Precoder codebook for advanced wireless communication systems

ABSTRACT

A method for operating user equipment (UE) in an advanced wireless communication network. The method comprises receiving, from an eNodeB (eNB), downlink signals indicating precoder codebook parameters that include a first number of antenna ports (N 1 ) for a first dimension, a second number of antenna ports (N 2 ) for a second dimension, and a codebook configuration, swapping precoder matrix indicator (PMI) expressions based on the N 1  and N 2 , and the codebook configuration in order to derive a first PMI pair (i 1,1 , i 1,2 ), and a second PMI (i 2 ) using a single precoder codebook, and transmitting, to the eNB, channel state information (CSI) including the first PMI pair and the second PMI.

CROSS-REFERENCE TO RELATED APPLICATION(S) AND CLAIM OF PRIORITY

The present application claims priority to U.S. Provisional Patent Application Ser. No. 62/245,694, filed on Oct. 23, 2015, entitled “Precoder Codebook for Advanced Wireless Communication Systems” and U.S. Provisional Patent Application Ser. No. 62/250,779, filed on Nov. 4, 2015, entitled “Precoder Codebook for Advanced Wireless Communication Systems.” The content of the above-identified patent documents are incorporated herein by reference.

TECHNICAL FIELD

The present application relates generally to codebook design for advanced wireless communication systems. More specifically, this disclosure relates to an efficient precoder codebook for advanced wireless communication systems.

BACKGROUND

Given the spatial multiplexing provided by FD-MIMO systems, understanding and correctly estimating the channel between a user equipment (UE) and an eNode B (eNB) is important for efficient and effective wireless communication. In order to correctly estimate the channel conditions, the UE will feedback information about channel measurement, e.g., channel state information (CSI), to the eNB. With this information about the channel, the eNB is able to select appropriate communication parameters to efficiently and effectively perform wireless data communication with the UE. However, with increase in the numbers of antennas and channel paths of wireless communication devices, so too has the amount of feedback increased that may be needed to ideally estimate the channel. This additionally-desired channel feedback may create additional overheads, thus reducing the efficiency of the wireless communication, for example, decrease the data rate.

SUMMARY

Embodiments of the present disclosure provide a precoder codebook for advanced wireless communication systems.

In one embodiment, an apparatus of a user equipment (UE) is provided. The UE includes a transceiver configured to receive, from an eNodeB (eNB), downlink signals indicating precoder codebook parameters that include a first number of antenna ports (N₁) for a first dimension, a second number of antenna ports (N₂) for a second dimension, and a codebook configuration. The UE further includes at least one processor configured to swap precoder matrix indicator (PMI) expressions based on the N₁ and N₂, and the codebook configuration in order to derive a first PMI pair (i_(1,1), i_(1,2)), and a second PMI (i₂) using a single precoder codebook, wherein the transceiver is further configured to transmit, to the eNB, channel state information (CSI) including the first PMI pair and the second PMI.

In another embodiment, an apparatus of an eNodeB (eNB) is provided. The apparatus includes a transceiver configured to transmit downlink signals, to a user equipment (UE), indicating precoder codebook parameters that include a first number of antenna ports (N₁) for a first dimension, a second number of antenna ports (N₂) for a second dimension, and a codebook configuration, and receive, from the UE, channel state information (CSI) including the first PMI pair and the second PMI. The apparatus further includes at least one processor configured to determine swap precoder matrix indicator (PMI) expressions based on the N₁ and N₂, and the codebook configuration in order to derive a first PMI pair (i_(1,1), i_(1,2)), and a second PMI (i₂) using a single precoder codebook.

In yet another embodiment, a method for operating user equipment (UE) in an advanced wireless communication network is provided. The method comprises receiving, from an eNodeB (eNB), downlink signals indicating precoder codebook parameters that include a first number of antenna ports (N₁) for a first dimension, a second number of antenna ports (N₂) for a second dimension, and a codebook configuration, swapping precoder matrix indicator (PMI) expressions based on the N₁ and N₂, and the codebook configuration in order to derive a first PMI pair (i_(1,1), i_(1,2)), and a second PMI (i₂) using a single precoder codebook, and transmitting, to the eNB, channel state information (CSI) including the first PMI pair and the second PMI.

Other technical features may be readily apparent to one skilled in the art from the following figures, descriptions, and claims.

Before undertaking the DETAILED DESCRIPTION below, it may be advantageous to set forth definitions of certain words and phrases used throughout this patent document. The term “couple” and its derivatives refer to any direct or indirect communication between two or more elements, whether or not those elements are in physical contact with one another. The terms “transmit,” “receive,” and “communicate,” as well as derivatives thereof, encompass both direct and indirect communication. The terms “include” and “comprise,” as well as derivatives thereof, mean inclusion without limitation. The term “or” is inclusive, meaning and/or. The phrase “associated with,” as well as derivatives thereof, means to include, be included within, interconnect with, contain, be contained within, connect to or with, couple to or with, be communicable with, cooperate with, interleave, juxtapose, be proximate to, be bound to or with, have, have a property of, have a relationship to or with, or the like. The term “controller” means any device, system or part thereof that controls at least one operation. Such a controller may be implemented in hardware or a combination of hardware and software and/or firmware. The functionality associated with any particular controller may be centralized or distributed, whether locally or remotely. The phrase “at least one of,” when used with a list of items, means that different combinations of one or more of the listed items may be used, and only one item in the list may be needed. For example, “at least one of: A, B, and C” includes any of the following combinations: A, B, C, A and B, A and C, B and C, and A and B and C.

Moreover, various functions described below can be implemented or supported by one or more computer programs, each of which is formed from computer readable program code and embodied in a computer readable medium. The terms “application” and “program” refer to one or more computer programs, software components, sets of instructions, procedures, functions, objects, classes, instances, related data, or a portion thereof adapted for implementation in a suitable computer readable program code. The phrase “computer readable program code” includes any type of computer code, including source code, object code, and executable code. The phrase “computer readable medium” includes any type of medium capable of being accessed by a computer, such as read only memory (ROM), random access memory (RAM), a hard disk drive, a compact disc (CD), a digital video disc (DVD), or any other type of memory. A “non-transitory” computer readable medium excludes wired, wireless, optical, or other communication links that transport transitory electrical or other signals. A non-transitory computer readable medium includes media where data can be permanently stored and media where data can be stored and later overwritten, such as a rewritable optical disc or an erasable memory device.

Definitions for other certain words and phrases are provided throughout this patent document. Those of ordinary skill in the art should understand that in many if not most instances, such definitions apply to prior as well as future uses of such defined words and phrases.

BRIEF DESCRIPTION OF THE DRAWINGS

For a more complete understanding of the present disclosure and its advantages, reference is now made to the following description taken in conjunction with the accompanying drawings, in which like reference numerals represent like parts:

FIG. 1 illustrates an example wireless network according to embodiments of the present disclosure;

FIG. 2 illustrates an example eNB according to embodiments of the present disclosure;

FIG. 3 illustrates an example UE according to embodiments of the present disclosure;

FIG. 4A illustrates a high-level diagram of an orthogonal frequency division multiple access transmit path according to embodiments of the present disclosure;

FIG. 4B illustrates a high-level diagram of an orthogonal frequency division multiple access receive path according to embodiments of the present disclosure;

FIG. 5 illustrates an example structure for a downlink (DL) subframe according to embodiments of the present disclosure;

FIG. 6 illustrates an example antenna configurations and numbering according to embodiments of the present disclosure;

FIG. 7 illustrates an example precoding weight application to antenna configurations according to embodiments of the present disclosure;

FIG. 8 illustrates an example antenna element (or transmit resource unit (TXRU)) numbering according to embodiments of the present disclosure;

FIG. 9 illustrates an example rank 3-4 orthogonal beam pair construction according to embodiments of the present disclosure;

FIG. 10 illustrates an example orthogonal beams for rank 3-4 according to embodiments of the present disclosure;

FIG. 11 illustrates an example orthogonal beam grouping for rank 5-8 according to embodiments of the present disclosure;

FIG. 12 illustrates another example orthogonal beam grouping for rank 5-8 according to embodiments of the present disclosure;

FIG. 13 illustrates yet another example orthogonal beam grouping for rank 5-8 according to embodiments of the present disclosure;

FIG. 14 illustrates yet another example orthogonal beam grouping for rank 5-8 according to embodiments of the present disclosure; and

FIG. 15 illustrates yet another example orthogonal beam grouping for rank 5-8 according to embodiments of the present disclosure.

DETAILED DESCRIPTION

FIG. 1 through FIG. 15, discussed below, and the various embodiments used to describe the principles of the present disclosure in this patent document are by way of illustration only and should not be construed in any way to limit the scope of the disclosure. Those skilled in the art will understand that the principles of the present disclosure may be implemented in any suitably arranged system or device.

The following documents and standards descriptions are hereby incorporated by reference into the present disclosure as if fully set forth herein: 3GPP TS 36.211 v12.2.0, “E-UTRA, Physical channels and modulation” (REF1); 3GPP TS 36.212 v12.2.0, “E-UTRA, Multiplexing and Channel coding” (REF2); 3GPP TS 36.213 v12.2.0, “E-UTRA, Physical Layer Procedures” (REF3); R1-154861, “WF on FD-MIMO codebook” (REF4); and R1-155005, “WF on precoder and PMI construction for R13 FD-MIMO.”

FIGS. 1-4B below describe various embodiments implemented in wireless communications systems and with the use of OFDM or OFDMA communication techniques. The descriptions of FIGS. 1-3 are not meant to imply physical or architectural limitations to the manner in which different embodiments may be implemented. Different embodiments of the present disclosure may be implemented in any suitably-arranged communications system.

FIG. 1 illustrates an example wireless network 100 according to embodiments of the present disclosure. The embodiment of the wireless network 100 shown in FIG. 1 is for illustration only. Other embodiments of the wireless network 100 could be used without departing from the scope of this disclosure.

As shown in FIG. 1, the wireless network 100 includes an eNB 101, an eNB 102, and an eNB 103. The eNB 101 communicates with the eNB 102 and the eNB 103. The eNB 101 also communicates with at least one network 130, such as the Internet, a proprietary Internet Protocol (IP) network, or other data network.

The eNB 102 provides wireless broadband access to the network 130 for a first plurality of user equipments (UEs) within a coverage area 120 of the eNB 102. The first plurality of UEs includes a UE 111, which may be located in a small business (SB); a UE 112, which may be located in an enterprise (E); a UE 113, which may be located in a WiFi hotspot (HS); a UE 114, which may be located in a first residence (R); a UE 115, which may be located in a second residence (R); and a UE 116, which may be a mobile device (M), such as a cell phone, a wireless laptop, a wireless PDA, or the like. The eNB 103 provides wireless broadband access to the network 130 for a second plurality of UEs within a coverage area 125 of the eNB 103. The second plurality of UEs includes the UE 115 and the UE 116. In some embodiments, one or more of the eNBs 101-103 may communicate with each other and with the UEs 111-116 using 5G, LTE, LTE-A, WiMAX, WiFi, or other wireless communication techniques.

Depending on the network type, other well-known terms may be used instead of “eNodeB” or “eNB,” such as “base station” or “access point.” For the sake of convenience, the terms “eNodeB” and “eNB” are used in this patent document to refer to network infrastructure components that provide wireless access to remote terminals. Also, depending on the network type, other well-known terms may be used instead of “user equipment” or “UE,” such as “mobile station,” “subscriber station,” “remote terminal,” “wireless terminal,” or “user device.” For the sake of convenience, the terms “user equipment” and “UE” are used in this patent document to refer to remote wireless equipment that wirelessly accesses an eNB, whether the UE is a mobile device (such as a mobile telephone or smartphone) or is normally considered a stationary device (such as a desktop computer or vending machine).

Dotted lines show the approximate extents of the coverage areas 120 and 125, which are shown as approximately circular for the purposes of illustration and explanation only. It should be clearly understood that the coverage areas associated with eNBs, such as the coverage areas 120 and 125, may have other shapes, including irregular shapes, depending upon the configuration of the eNBs and variations in the radio environment associated with natural and man-made obstructions.

As described in more detail below, one or more of the UEs 111-116 include circuitry, programming, or a combination thereof, for precoder codebook processing. In certain embodiments, and one or more of the eNBs 101-103 includes circuitry, programming, or a combination thereof, for processing of channel state information (CSI) received from the UEs 111-116 in accordance with a first number of antenna ports (N₁) for a first dimension and a second number of antenna ports (N₂) for a second dimension.

Although FIG. 1 illustrates one example of a wireless network 100, various changes may be made to FIG. 1. For example, the wireless network 100 could include any number of eNBs and any number of UEs in any suitable arrangement. Also, the eNB 101 could communicate directly with any number of UEs and provide those UEs with wireless broadband access to the network 130. Similarly, each eNB 102-103 could communicate directly with the network 130 and provide UEs with direct wireless broadband access to the network 130. Further, the eNBs 101, 102, and/or 103 could provide access to other or additional external networks, such as external telephone networks or other types of data networks.

FIG. 2 illustrates an example eNB 102 according to embodiments of the present disclosure. The embodiment of the eNB 102 illustrated in FIG. 2 is for illustration only, and the eNBs 101 and 103 of FIG. 1 could have the same or similar configuration. However, eNBs come in a wide variety of configurations, and FIG. 2 does not limit the scope of this disclosure to any particular implementation of an eNB.

As shown in FIG. 2, the eNB 102 includes multiple antennas 205 a-205 n, multiple RF transceivers 210 a-210 n, transmit (TX) processing circuitry 215, and receive (RX) processing circuitry 220. The eNB 102 also includes a controller/processor 225, a memory 230, and a backhaul or network interface 235.

The RF transceivers 210 a-210 n receive, from the antennas 205 a-205 n, incoming RF signals, such as signals transmitted by UEs in the wireless network 100. The RF transceivers 210 a-210 n down-convert the incoming RF signals to generate IF or baseband signals. The IF or baseband signals are sent to the RX processing circuitry 220, which generates processed baseband signals by filtering, decoding, and/or digitizing the baseband or IF signals. The RX processing circuitry 220 transmits the processed baseband signals to the controller/processor 225 for further processing.

In some embodiments, the RF transceiver 210 a-210 n is also capable of transmitting downlink signals, to a user equipment (UE), including the single precoder codebook parameters, wherein a precoder matrix indicator (PMI) expression based on a codebook configuration in accordance with the single precoder codebook parameters is swapped at the UE. In some embodiment, the RF transceiver 210 a-210 n is also capable of receiving, from the UE, a reporting message including channel state information (CSI) based on the N₁ and N₂.

In some embodiments, the RF transceiver 210 a-210 n is also capable of transmitting downlink signals, to the UE, including the single precoder codebook parameters, wherein the PMI expression based on the codebook configuration in accordance with the precoder codebook parameter is parameterized based on a pair of parameters comprising (d₁, d₂) in accordance with the N₁ and N₂.

The TX processing circuitry 215 receives analog or digital data (such as voice data, web data, e-mail, or interactive video game data) from the controller/processor 225. The TX processing circuitry 215 encodes, multiplexes, and/or digitizes the outgoing baseband data to generate processed baseband or IF signals. The RF transceivers 210 a-210 n receive the outgoing processed baseband or IF signals from the TX processing circuitry 215 and up-converts the baseband or IF signals to RF signals that are transmitted via the antennas 205 a-205 n.

The controller/processor 225 can include one or more processors or other processing devices that control the overall operation of the eNB 102. For example, the controller/processor 225 could control the reception of forward channel signals and the transmission of reverse channel signals by the RF transceivers 210 a-210 n, the RX processing circuitry 220, and the TX processing circuitry 215 in accordance with well-known principles. The controller/processor 225 could support additional functions as well, such as more advanced wireless communication functions. For instance, the controller/processor 225 could support beam forming or directional routing operations in which outgoing signals from multiple antennas 205 a-205 n are weighted differently to effectively steer the outgoing signals in a desired direction. Any of a wide variety of other functions could be supported in the eNB 102 by the controller/processor 225. In some embodiments, the controller/processor 225 includes at least one microprocessor or microcontroller. As described in more detail below, the eNB 102 may include circuitry, programming, or a combination thereof for processing of CSI received from the UE 111-116 in accordance with a first number of antenna ports (N₁) for a first dimension and a second number of antenna ports (N₂) for a second dimension. For example, controller/processor 225 can be configured to execute one or more instructions, stored in memory 230, that are configured to cause the controller/processor to process CSI received from the UE 111-116 in accordance with a first number of antenna ports (N₁) for a first dimension and a second number of antenna ports (N₂) for a second dimension.

The controller/processor 225 is also capable of executing programs and other processes resident in the memory 230, such as an OS. The controller/processor 225 can move data into or out of the memory 230 as required by an executing process.

The controller/processor 225 is also coupled to the backhaul or network interface 235. The backhaul or network interface 235 allows the eNB 102 to communicate with other devices or systems over a backhaul connection or over a network. The interface 235 could support communications over any suitable wired or wireless connection(s). For example, when the eNB 102 is implemented as part of a cellular communication system (such as one supporting 5G, LTE, or LTE-A), the interface 235 could allow the eNB 102 to communicate with other eNBs over a wired or wireless backhaul connection. When the eNB 102 is implemented as an access point, the interface 235 could allow the eNB 102 to communicate over a wired or wireless local area network or over a wired or wireless connection to a larger network (such as the Internet). The interface 235 includes any suitable structure supporting communications over a wired or wireless connection, such as an Ethernet or RF transceiver.

The memory 230 is coupled to the controller/processor 225. Part of the memory 230 could include a RAM, and another part of the memory 230 could include a Flash memory or other ROM.

Although FIG. 2 illustrates one example of eNB 102, various changes may be made to FIG. 2. For example, the eNB 102 could include any number of each component shown in FIG. 2. As a particular example, an access point could include a number of interfaces 235, and the controller/processor 225 could support routing functions to route data between different network addresses. As another particular example, while shown as including a single instance of TX processing circuitry 215 and a single instance of RX processing circuitry 220, the eNB 102 could include multiple instances of each (such as one per RF transceiver). Also, various components in FIG. 2 could be combined, further subdivided, or omitted and additional components could be added according to particular needs.

FIG. 3 illustrates an example UE 116 according to embodiments of the present disclosure. The embodiment of the UE 116 illustrated in FIG. 3 is for illustration only, and the UEs 111-115 of FIG. 1 could have the same or similar configuration. However, UEs come in a wide variety of configurations, and FIG. 3 does not limit the scope of this disclosure to any particular implementation of a UE.

As shown in FIG. 3, the UE 116 includes a plurality of antennas 305, a radio frequency (RF) transceiver 310, TX processing circuitry 315, a microphone 320, and receive (RX) processing circuitry 325. The UE 116 also includes a speaker 330, a processor 340, an input/output (I/O) interface (IF) 345, a touchscreen 350, a display 355, and a memory 360. The memory 360 includes an operating system (OS) 361 and one or more applications 362.

The RF transceiver 310 receives, from the plurality of antennas 305, an incoming RF signal transmitted by an eNB of the wireless network 100. The RF transceiver 310 down-converts the incoming RF signal to generate an intermediate frequency (IF) or baseband signal. The IF or baseband signal is sent to the RX processing circuitry 325, which generates a processed baseband signal by filtering, decoding, and/or digitizing the baseband or IF signal. The RX processing circuitry 325 transmits the processed baseband signal to the speaker 330 (such as for voice data) or to the processor 340 for further processing (such as for web browsing data).

In some embodiments, the RF transceiver 310 is also capable of receiving, from an eNodeB (eNB), downlink signals indicating precoder codebook parameters that comprise a first number of antenna ports (N₁) for a first dimension and a second number of antenna ports (N₂) for a second dimension

The TX processing circuitry 315 receives analog or digital voice data from the microphone 320 or other outgoing baseband data (such as web data, e-mail, or interactive video game data) from the processor 340. The TX processing circuitry 315 encodes, multiplexes, and/or digitizes the outgoing baseband data to generate a processed baseband or IF signal. The RF transceiver 310 receives the outgoing processed baseband or IF signal from the TX processing circuitry 315 and up-converts the baseband or IF signal to an RF signal that is transmitted via the plurality of antennas 305.

The processor 340 can include one or more processors or other processing devices and execute the OS 361 stored in the memory 360 in order to control the overall operation of the UE 116. For example, the processor 340 could control the reception of forward channel signals and the transmission of reverse channel signals by the RF transceiver 310, the RX processing circuitry 325, and the TX processing circuitry 315 in accordance with well-known principles. In some embodiments, the processor 340 includes at least one microprocessor or microcontroller.

The processor 340 is also capable of executing other processes and programs resident in the memory 360, such as processes for identifying a codebook configuration based on a single precoder codebook in accordance with the N₁ and N₂ and swapping precoder matrix indicator (PMI) expressions based on the identified codebook configuration, wherein the transceiver is further configured to transmit, to the eNB, a reporting message including channel state information (CSI) based on the N₁ and N₂.

In some embodiments, the processor 340 is also capable of determine dummy variables based on a pair of parameters comprising (d₁, d₂) in accordance with the N₁ and N₂, the dummy variables being determined as i_(1,d1)=x and i_(1,d2)=y. Wherein a rank-1 codebook for a codebook configuration 3 is determined based on the dummy variables.

In some embodiments, the processor 340 is also capable of identifying a pair of parameters comprising (d₁, d₂) based on the N₁ and N₂ and parameterizing a codebook table based on the identified pair of parameters (d₁, d₂). Wherein the (d₁, d₂) are defined as at least one of (d₁, d₂)=(1, 2) when the N₁ is greater or equal to the N₂ or (d₁, d₂)=(2, 1) when the N₁ is less than the N₂. In one example, when the (d₁, d₂)=(1, 2), a master codebook for a 1 layer CSI reporting is determined. In another example, when the (d₁, d₂)=(2, 1), the master codebook for the 1 layer CSI reporting is determined.

In some embodiments, the processor 340 is also capable of determining a first discrete fourier transform (DFT) vector (v_(m)) representing a vertical beam for the first dimension and a second DFT vector (u_(n))) representing a horizontal DFT beam for the second dimension; and swapping the PMI expressions in a rank 1 codebook and a rank 2 codebook for a codebook configuration 3 and a codebook configuration 4 based on the determined first and second DFT vectors. In such embodiments, the swapped PMI expressions comprise an order of (m₁, m₂) based on the N₁ and N₂. In one example, when the N₁ is greater or equals to the N₂, a rank 1 precoder based on the swapped PMI expressions is determined as

${W_{m_{1},m_{2},n}^{(1)} = {\frac{1}{\sqrt{Q}}\begin{bmatrix} w_{m_{1},m_{2}} \\ {\phi_{n}w_{m_{1},m_{2}}} \end{bmatrix}}},$

where v_(m) ₁

u_(m) ₂ is w_(m) _(i) _(,m) ₂ . In another example, when the N₁ is less than the N₂, the rank 1 precoder based on the swapped PMI expression is determined as

$W_{m_{1},m_{2},n}^{(1)} = {\frac{1}{\sqrt{Q}}\begin{bmatrix} w_{m_{1},m_{2}} \\ {\phi_{n}w_{m_{2},m_{1}}} \end{bmatrix}}$

where v_(m) ₁

u_(m) ₂ is w_(m) _(i) _(,m) ₂ .

The processor 340 can move data into or out of the memory 360 as required by an executing process. In some embodiments, the processor 340 is configured to execute the applications 362 based on the OS 361 or in response to signals received from eNBs or an operator. The processor 340 is also coupled to the I/O interface 345, which provides the UE 116 with the ability to connect to other devices, such as laptop computers and handheld computers.

The I/O interface 345 is the communication path between these accessories and the processor 340.

The processor 340 is also coupled to the touchscreen 350 and the display 355. The operator of the UE 116 can use the touchscreen 350 to enter data into the UE 116. The display 355 may be a liquid crystal display, light emitting diode display, or other display capable of rendering text and/or at least limited graphics, such as from web sites.

The memory 360 is coupled to the processor 340. Part of the memory 360 could include a random access memory (RAM), and another part of the memory 360 could include a Flash memory or other read-only memory (ROM).

Although FIG. 3 illustrates one example of UE 116, various changes may be made to FIG. 3. For example, various components in FIG. 3 could be combined, further subdivided, or omitted and additional components could be added according to particular needs. As a particular example, the processor 340 could be divided into multiple processors, such as one or more central processing units (CPUs) and one or more graphics processing units (GPUs). Also, while FIG. 3 illustrates the UE 116 configured as a mobile telephone or smartphone, UEs could be configured to operate as other types of mobile or stationary devices.

FIG. 4A is a high-level diagram of transmit path circuitry 400. For example, the transmit path circuitry 400 may be used for an orthogonal frequency division multiple access (OFDMA) communication. FIG. 4B is a high-level diagram of receive path circuitry 450. For example, the receive path circuitry 450 may be used for an orthogonal frequency division multiple access (OFDMA) communication. In FIGS. 4A and 4B, for downlink communication, the transmit path circuitry 400 may be implemented in a base station (eNB) 102 or a relay station, and the receive path circuitry 450 may be implemented in a user equipment (e.g. user equipment 116 of FIG. 1). In other examples, for uplink communication, the receive path circuitry 450 may be implemented in a base station (e.g. eNB 102 of FIG. 1) or a relay station, and the transmit path circuitry 400 may be implemented in a user equipment (e.g. user equipment 116 of FIG. 1).

Transmit path circuitry 400 comprises channel coding and modulation block 405, serial-to-parallel (S-to-P) block 410, Size N Inverse Fast Fourier Transform (IFFT) block 415, parallel-to-serial (P-to-S) block 420, add cyclic prefix block 425, and up-converter (UC) 430. Receive path circuitry 450 comprises down-converter (DC) 455, remove cyclic prefix block 460, serial-to-parallel (S-to-P) block 465, Size N Fast Fourier Transform (FFT) block 470, parallel-to-serial (P-to-S) block 475, and channel decoding and demodulation block 480.

At least some of the components in FIGS. 4A and 4B may be implemented in software, while other components may be implemented by configurable hardware or a mixture of software and configurable hardware. In particular, it is noted that the FFT blocks and the IFFT blocks described in this disclosure document may be implemented as configurable software algorithms, where the value of Size N may be modified according to the implementation.

Furthermore, although this disclosure is directed to an embodiment that implements the Fast Fourier Transform and the Inverse Fast Fourier Transform, this is by way of illustration only and should not be construed to limit the scope of the disclosure. It will be appreciated that in an alternate embodiment of the disclosure, the Fast Fourier Transform functions and the Inverse Fast Fourier Transform functions may easily be replaced by Discrete Fourier Transform (DFT) functions and Inverse Discrete Fourier Transform (IDFT) functions, respectively. It will be appreciated that for DFT and IDFT functions, the value of the N variable may be any integer number (i.e., 1, 4, 3, 4, etc.), while for FFT and IFFT functions, the value of the N variable may be any integer number that is a power of two (i.e., 1, 2, 4, 8, 16, etc.).

In transmit path circuitry 400, channel coding and modulation block 405 receives a set of information bits, applies coding (e.g., LDPC coding) and modulates (e.g., Quadrature Phase Shift Keying (QPSK) or Quadrature Amplitude Modulation (QAM)) the input bits to produce a sequence of frequency-domain modulation symbols. Serial-to-parallel block 410 converts (i.e., de-multiplexes) the serial modulated symbols to parallel data to produce N parallel symbol streams where N is the IFFT/FFT size used in BS 102 and UE 116. Size N IFFT block 415 then performs an IFFT operation on the N parallel symbol streams to produce time-domain output signals. Parallel-to-serial block 420 converts (i.e., multiplexes) the parallel time-domain output symbols from Size N IFFT block 415 to produce a serial time-domain signal. Add cyclic prefix block 425 then inserts a cyclic prefix to the time-domain signal. Finally, up-converter 430 modulates (i.e., up-converts) the output of add cyclic prefix block 425 to RF frequency for transmission via a wireless channel. The signal may also be filtered at baseband before conversion to RF frequency.

The transmitted RF signal arrives at UE 116 after passing through the wireless channel, and reverse operations to those at eNB 102 are performed. Down-converter 455 down-converts the received signal to baseband frequency, and remove cyclic prefix block 460 removes the cyclic prefix to produce the serial time-domain baseband signal. Serial-to-parallel block 465 converts the time-domain baseband signal to parallel time-domain signals. Size N FFT block 470 then performs an FFT algorithm to produce N parallel frequency-domain signals. Parallel-to-serial block 475 converts the parallel frequency-domain signals to a sequence of modulated data symbols. Channel decoding and demodulation block 480 demodulates and then decodes the modulated symbols to recover the original input data stream.

Each of eNBs 101-103 may implement a transmit path that is analogous to transmitting in the downlink to user equipment 111-116 and may implement a receive path that is analogous to receiving in the uplink from user equipment 111-116. Similarly, each one of user equipment 111-116 may implement a transmit path corresponding to the architecture for transmitting in the uplink to eNBs 101-103 and may implement a receive path corresponding to the architecture for receiving in the downlink from eNBs 101-103.

FIG. 5 illustrates an example structure for a DL subframe 500 according to embodiments of the present disclosure. An embodiment of the DL subframe structure 500 shown in FIG. 1 is for illustration only. Other embodiments may be used without departing from the scope of the present disclosure. The downlink subframe (DL SF) 510 includes two slots 520 and a total of N^(DL) _(symb) symbols for transmitting of data information and downlink control information (DCI). The first M_(DL) ^(symb) SF symbols are used to transmit PDCCHs and other control channels 530 (not shown in FIG. 5). The remaining N^(DL) _(symb)−M^(DL) _(symb) SF symbols are primarily used to symb transmit physical downlink shared channels (PDSCHs) 540, 542, 544, 546, and 548 or enhanced physical downlink control channels (EPDCCHs) 550, 552, 554, and 556. A transmission bandwidth (BW) comprises frequency resource units referred to as resource blocks (RBs). Each RB comprises either N_(sc) ^(RB) sub-carriers or resource elements (REs) (such as 12 Res). A unit of one RB over one subframe is referred to as a physical RB (PRB). A UE is allocated to M_(PDSCH) RBs for a total of M_(sc) ^(PDSCH)=M_(PDSCH)·N_(sc) ^(RB) REs for a PDSCH transmission BW. An EPDCCH transmission is achieved in either one RB or multiple of RBs.

FIG. 6 illustrates an example antenna configurations and numbering 600 according to embodiments of the present disclosure. An embodiment of the antenna configurations and numbering 600 shown in FIG. 6 is for illustration only. Other embodiments may be used without departing from the scope of the present disclosure. As shown in FIG. 6, the antenna configurations and numbering 600 comprise a 16 port configuration A 605, a 12 port configuration A 610, a 16 port configuration B 615, and a 12 port configuration B 620.

As shown in FIG. 6, in all of the four antenna configurations (e.g., 12 port configuration A and B, and 16 port configuration A and B), a cross pol (or X-pol) antenna array is considered, in which a pair of antenna elements in the same physical location is polarized in two distinct angles (e.g., +45 degrees and −45 degrees). More specifically, the 16 port configuration A 605 and the 16 port configuration B 615 are antenna configurations with 16 CSI-RS ports comprising 8 pairs of x-pol antenna elements placed in a 2D antenna panel. The 8 pairs can be placed in 2×4 (e.g., 605) or 4×2 manner (e.g., 615) on horizontal and vertical dimensions. In addition, the 12 port configuration 610 and the 12 port configuration B 620 are antenna configurations with 12 CSI-RS ports comprising 6 pairs of x-pol antenna elements placed in a 2D antenna panel. The 6 pairs can be placed in 2×3 (e.g., 610) or 3×2 manner (e.g., 620) on horizontal and vertical dimensions.

In some embodiments, antennas are indexed with integer numbers, 0, 1, . . . , 15 for 16-port configurations (e.g., 605, 610), and 0, . . . , 11 for 12-port configurations (e.g., 610, 620). In fat arrays (such as 12-port configuration 610 A and 16-port configuration A 605), antenna numbers are assigned such that consecutive numbers are assigned for all the antenna elements for a first polarization and proceed to a second polarization. For a given polarization, there may be some different numbering schemes. In one example (e.g., numbering scheme 1), consecutive numbers are assigned for a first row with progressing one edge to another edge and proceed to a second row. In another example (e.g., numbering scheme 2), consecutive numbers are assigned for a first column with progressing one edge to another edge and proceed to a second column.

For example, in the 16 port configuration A 605, antenna numbers 0-7 are assigned for a first polarization and 8-15 are assigned for a second polarization, and antenna numbers 0-3 are assigned for a first row and 4-7 are assigned for a second row. Antenna numbers in tall arrays (such as the 12-port configuration B 620 and the 16-port configuration B 615) are obtained by simply rotating the fat antenna arrays (such as the 12-port configuration A 610 and 16-port configuration A 605) by 90 degrees.

In some embodiments, when a UE is configured with 12 or 16 port CSI-RS for a CSI-RS resource, the UE is configured to report a PMI feedback precoder according to the antenna numbers as shown FIG. 6. A rank-1 precoder, W_(m,n,p), which is an N_(CSIRS)×1 vector, to be reported by the UE is given by:

$W_{m,n,p} = {\begin{bmatrix} w_{0} & w_{1} & \ldots & w_{N_{CSIRS} - 1} \end{bmatrix}^{t} = {\frac{1}{\sqrt{N_{CSIRS}}}\begin{bmatrix} {v_{m} \otimes u_{n}} \\ {\phi_{p}\left( {v_{m^{\prime}} \otimes u_{n^{\prime}}} \right)} \end{bmatrix}}}$

Where, N_(CSIRS)=number of configured CSI-RS ports in the CSI-RS resource (e.g., 12, 16, etc.), u_(n) is a N×1 oversampled DFT vector for a second dimension, whose oversampling factor is S_(N), v_(m) is a M×1 oversampled DFT vector for a first dimension, whose oversampling factor is S_(M), and φ_(p) is a co-phase (e.g., in a form of

$^{\frac{2\pi \; p}{4}},$

p=0, 1, 2, 3).

The dimension assignment can be done with N according to the numbering scheme 1 as shown in FIG. 6, with (N,M)ε{(4,2), (4,3), (2,2)}; alternatively, the dimension assignment can be done with N with swapping the role of columns and rows, with (N,M)ε{(2,4), (3,4), (2,2)} according to the numbering scheme 2 as shown in FIG. 6. In one example, a set of oversampling factors that can be configured for S_(N) and S_(M) are {2, 4, 8}; and m, m′ε{0, 1, . . . S_(M)M}, and n, n′ε{0, 1, . . . , S_(N)N}. In a special case, m=m′ and n=n′.

When any of 16-port configuration A 605 and B 615 for numbering scheme 1 in FIG. 6 is used at an eNB with configuring N_(CSIRS)=16 to a UE, a submatrix v_(n) {circle around (X)}u_(n) of W_(m,n,p) corresponds to a precoder applied on 8 co-pol elements, whose antenna numbers are 0 through 7. Given the antenna configuration, M=2 and N=4 may be configured for and u_(n).

If 16-port configuration A 605 is used, u_(n) is a 4×1 vector representing a horizontal DFT beam and v_(n) is a 2×1 vector representing a vertical DFT beam. If 16-port configuration B 615 is used, u_(n) is a 4×1 vector representing a vertical DFT beam and v_(n) is a 2×1 vector representing a horizontal DFT beam.

With 12 or 16-port configurations, v_(m) can be written as:

$v_{m} = {\begin{bmatrix} 1 & ^{j\frac{2\pi \; m}{M^{\prime}}} \end{bmatrix}^{t} = {\begin{bmatrix} 1 & ^{j\frac{2\pi \; m}{{MS}_{M}}} \end{bmatrix}^{t}.}}$

With 16-port configurations, u_(n) can be written as:

$u_{n} = {\begin{bmatrix} 1 & ^{j\frac{2\pi \; n}{N^{\prime}}} & ^{j\frac{4\pi \; m}{N^{\prime}}} & ^{j\frac{6\pi \; m}{N^{\prime}}} \end{bmatrix}^{t} = {\begin{bmatrix} 1 & ^{j\frac{2\pi \; n}{{NS}_{N}}} & ^{j\frac{4\pi \; m}{{NS}_{N}}} & ^{j\frac{6\pi \; m}{{NS}_{N}}} \end{bmatrix}^{t}.}}$

With 12-port configurations, u_(n) can be written as:

$u_{n} = {\begin{bmatrix} 1 & ^{j\frac{2\pi \; n}{N^{\prime}}} & ^{j\frac{4\pi \; m}{N^{\prime}}} \end{bmatrix}^{t} = {\begin{bmatrix} 1 & ^{j\frac{2\pi \; n}{{NS}_{N}}} & ^{j\frac{4\pi \; m}{{NS}_{N}}} \end{bmatrix}^{t}.}}$

FIG. 7 illustrates an example precoding weight application 700 to antenna configurations according to embodiments of the present disclosure. An embodiment of the precoding weight application 700 to antenna configurations shown in FIG. 7 is for illustration only. Other embodiments may be used without departing from the scope of the present disclosure. As shown in FIG. 7, the precoding weight application 700 comprises a 16 port configuration A 705 and a 16 port configuration B 710.

Precoding weights to be applied to antenna port numbers 0 through 3 in the 16 port configuration A 705 and B 710 are u_(n), and the precoding weights to be applied to antenna ports numbers 4 through 7 in the 16 port configuration A 705 and B 710 are

$u_{n}^{j\frac{2\pi \; m}{{MS}_{M}}}$

with an appropriate power normalization factor. Similarly, precoding weights to be applied to antenna port numbers 8 through 11 are u_(n′), and the precoding weights to be applied to antenna ports 12 through 15 are

$u_{n^{\prime}}^{j\frac{2\pi \; m^{\prime}}{{MS}_{M}}}$

with an appropriate power normalization factor. The number ring scheme 1 and 2 in FIG. 6 may be applied to the precoding weight application 700 as shown in FIG. 7.

FIG. 8 illustrates an example antenna element (or transmit resource unit (TXRU)) numbering 800 according to embodiments of the present disclosure. An embodiment of the antenna element (or transmit resource unit (TXRU)) numbering 800 shown in FIG. 8 is for illustration only. Other embodiments may be used without departing from the scope of the present disclosure.

In some embodiments, an eNB is equipped with 2D rectangular antenna array (or TXRUs) comprising M rows and N columns with P=2 polarized, wherein each element (or TXRU) is indexed with (m, n, p), and m=0, . . . , M−1, n=0, . . . , N−1, p=0, . . . , P−1, as shown in FIG. 8 with M=N=4. When FIG. 8 represents a TXRU array, the TXRU can be associated with multiple antenna elements. In one example (1-dimensional (1D) subarray partition), an antenna array comprising a column with a same polarization of a 2D rectangular array is partitioned into M groups of consecutive elements, and the M groups correspond to the M TXRUs in a column with a same polarization in the TXRU array as shown in FIG. 8.

In some embodiments, a UE is configured with a CSI-RS resource comprising Q=MNP number of CSI-RS ports, wherein the CSI-RS resource is associated with MNP number of resource elements (REs) in a pair of PRBs in a subframe.

In some embodiments, a UE is configured with a CSI-RS configuration via higher layer, configuring Q antenna ports—antenna ports A(1) through A(Q). The UE is further configured with CSI reporting configuration via higher layer in association with the CSI-RS configuration. The CSI reporting configuration includes information element (IE) indicating the CSI-RS decomposition information (or component PMI port configuration). The information element may comprise at least two integers, say N₁ and N₂, which respectively indicates a first number of antenna ports per pol for a first dimension, and a second number of antenna ports per pol for a second dimension, wherein Q=P·N₁·N₂.

In some embodiments, the first dimension may correspond to the horizontal direction or columns, and the second dimension may correspond to the vertical direction or rows, i.e., (N₁, N₂)=(N, M).

In some embodiments, the first dimension may correspond to the vertical direction or rows, and the second dimension may correspond to the horizontal direction or columns, i.e., (N₁, N₂)=(M, N).

In the rest of the disclosure, a notation (N₁, N₂) will be used in place of (M, N) or (N, M). Similarly, a notation (O₁, O₂) will be used for the oversampling factors in the two dimensions in place of (S_(N), S_(M)) or (S_(M), S_(N)).

A beam grouping scheme and a codebook can be defined in terms of two groups of parameters and one group per dimension. A group of parameters for dimension d comprises at least one of a number of antenna ports per pol N_(d), an oversampling factor O_(d), a skip number (or beam group spacing) s_(d) (e.g., for W1), a beam offset number f_(d), a beam spacing number p_(d) (e.g., for W2), or a number of beams (in each beam group) L_(d).

A beam group indicated by a first PMI i_(1,d) of dimension d (corresponding to W_(d) ⁽¹⁾) is determined based upon some parameters. For example, a total number of beams is N_(d)*o_(d) and the beams are indexed by an integer m_(d), wherein beam m_(d), v_(m) _(d) , corresponds to a precoding vector

${v_{m_{d}} = \begin{bmatrix} 1 & ^{j\frac{2\pi \; m_{d}}{O_{d}N_{d}}} & \ldots & ^{j\frac{2\pi \; {m_{d}{({N_{d} - 1})}}}{O_{d}N_{d}}} \end{bmatrix}^{t}},$

m_(d)=0, . . . , N_(d)*O_(d)−1. The first PMI of the first dimension i_(1,d), i_(1,d)=0, . . . , N_(d)·O_(d)/s_(d)−1, can indicate any of L_(d) beams indexed by m_(d)=f_(d)+s_(d)·i_(1,d), f_(d)+s_(d)·i_(1,d)+p_(d), . . . , f_(d)+s_(d)·i_(1,d)+(L_(d)−1)p_(d), wherein these L_(d) beams are referred to as a beam group.

Class A codebook in LTE specification may be configured with some RRC parameters, for example, N₁, N₂={1, 2, 3, 4, 8} where the valid candidates are (N₁, N₂)=(8, 1), (2, 2), (2, 3), (3, 2), (2, 4), (4, 2), and O₁, O₂={2, 4, 8}, and Config={1, 2, 3, 4}. For dimension with one port, an oversampling factor and Config={2, 3} may not be applied to. In this example, for each (N₁, N₂), configurability of (O₁, O₂) is restricted to two possible fixed pairs as shown in Table 1.

TABLE 1 (N1, N2) (O1, O2) combinations (8, 1) (4, —), (8, —) (2, 2) (4, 4), (8, 8) (2, 3) {(8, 4), (8, 8)} (3, 2) {(8, 4), (4, 4)} (2, 4) {(8, 4), (8, 8)} (4, 2) {(8, 4), (4, 4)}

Given the set of values of N₁, N₂, O₁, O₂, W₁ matrices with (L′₁,L′₂)=(4,2), (2,4) are constructed for N₁>=N₂ and N₁<N₂, respectively. In this instance,

$W_{1} = \begin{pmatrix} {X_{1}^{m_{1}} \otimes X_{2}^{m_{2}}} & 0 \\ 0 & {X_{1}^{m_{1}} \otimes X_{2}^{m_{2}}} \end{pmatrix}$

where m_(i) is the index for X_(i) and an associated codebook table is defined in terms of i′₂, i₁₁ and i₁₂.

Given the value of Config, a subset of codewords from the codebook table is selected as an active subset of values of i′₂, associated with at least one of configurations, for example, Config=1: (L₁, L₂)=(1, 1) for rank 1-2, Config=2: (L₁, L₂)=(2, 2) for rank 1-2 [square], Config=3: (L₁, L₂)=(2, 2) for rank 1-2 [non-adjacent 2D beams/checkerboard], Config=4: (L₁, L₂)=(4, 1), (1, 4) for N₁>=N₂ and N₁<N₂ respectively for rank 1-2, or TBD rank 3-8.

TABLE 2 i₂′ 0 1 2 3 Precoder W_(s) ₁i_(1,1),s₂i_(1,2),0⁽¹⁾ W_(s) ₁i_(1,1),s₂i_(1,2),1⁽¹⁾ W_(s) ₁i_(1,1),s₂i_(1,2),2⁽¹⁾ W_(s) ₁i_(1,1),s₂i_(1,2),3⁽¹⁾ i₂′ 4 5 6 7 Precoder W_(s) ₁i_(1,1)+1,s₂i_(1,2),0⁽¹⁾ W_(s) ₁i_(1,1)+1,s₂i_(1,2),1⁽¹⁾ W_(s) ₁i_(1,1)+1,s₂i_(1,2),2⁽¹⁾ W_(s) ₁i_(1,1)+1,s₂i_(1,2),3⁽¹⁾ i₂′ 8 9 10 11 Precoder W_(s) ₁i_(1,1)+2,s₂i_(1,2),0⁽¹⁾ W_(s) ₁i_(1,1)+2,s₂i_(1,2),1⁽¹⁾ W_(s) ₁i_(1,1)+2,s₂i_(1,2),2⁽¹⁾ W_(s) _(1,)i_(1,1)+2,s₂i_(1,2),3⁽¹⁾ i₂′ 12 13 14 15 Precoder W_(s) ₁i_(1,1)+3,s₂i_(1,2),0⁽¹⁾ W_(s) ₁i_(1,1)+3,s₂i_(1,2),1⁽¹⁾ W_(s) ₁i_(1,1)+3,s₂i_(1,2),2⁽¹⁾ W_(s) ₁i_(1,1)+3,s₂i_(1,2),3⁽¹⁾ i₂′ 16-31 Precoder Entries 16-31 constructed with replacing the second subscript s₂i_(1,2) with s₂i_(1,2) + 1 in entries 0-15.

Table 2 shows a master codebook for 1 layer CSI reporting (with 32 CWs, (L′₁, L′₂)=(4, 2)). A UE selects 4 or 16 CWs for the second PMI i₂ to be reported on PUSCH, based on Config from Table 3, wherein the corresponding rank 1 precoder is given by:

${W_{m_{1},m_{2},n}^{(1)} = {\frac{1}{\sqrt{Q}}\begin{bmatrix} {v_{m_{1}} \otimes u_{m_{2}}} \\ {\phi_{n}{v_{m_{1}} \otimes u_{m_{2}}}} \end{bmatrix}}},{{{where}\mspace{14mu} v_{m_{1}}} = \begin{bmatrix} 1 & ^{j\frac{2\pi \; m_{1}}{O_{1}N_{1}}} & \ldots & ^{j\frac{2\pi \; {m_{1}{({N_{1} - 1})}}}{O_{1}N_{1}}} \end{bmatrix}^{t}},{u_{m_{2}} = \begin{bmatrix} 1 & ^{j\frac{2\pi \; m_{2}}{O_{2}N_{2}}} & \ldots & ^{j\frac{2\pi \; {m_{2}{({N_{2} - 1})}}}{O_{2}N_{2}}} \end{bmatrix}^{t}},{{{and}\mspace{14mu} \phi_{n}} = {^{j\frac{\pi \; n}{2}}.}}$

Note that Table 2 is applicable to N₁>=N₂. For N₁<N₂, (L′₁, L′₂)=(2, 4) may be used. Accordingly, the codebook table needs to modified so that it can be used for N₁<N₂ configuration also.

Since the antenna port configurations (N₁, N₂) are symmetric in the sense that the antenna port layouts are transpose of one another. For example (N₁, N₂)=(2, 4) and (4, 2) for 16 port and (N₁, N₂)=(2, 3) and (3, 2) as shown in FIG. 6. For such antenna port layouts, the same codebook table may be used for representing the different pre-coding vectors and matrices in the two layouts.

In some embodiments, there is one (master) codebook table for both of symmetric antenna port configurations. In this case, two symmetric port configurations may be defined for N₁≧N₂ (configuration A) and N₁<N₂ (configuration B) as shown FIG. 6. However, depending on the configured antenna port configuration, the pre-coder may be derived differently.

In some embodiments, an order of (m₁, m₂) in W_(m) ₁ _(m) ₂ _(n) ⁽¹⁾ expression is swapped dependent on a configuration. For instance, for the configuration in which N₁≧N₂, the order is (m₁, m₂), and the UE derives the rank-1 pre-coder as

${W_{m_{1},m_{2},n}^{(1)} = {\frac{1}{\sqrt{Q}}\begin{bmatrix} {v_{m_{1}} \otimes u_{m_{2}}} \\ {\phi_{n}{v_{m_{1}} \otimes u_{m_{2}}}} \end{bmatrix}}},$

and for the configuration in which N₁<N₂, the order is (m₂, m₁), and the UE derives the rank-1 pre-coder as

$W_{m_{1},m_{2},n}^{(1)} = {{\frac{1}{\sqrt{Q}}\begin{bmatrix} {v_{m_{2}} \otimes u_{m_{1}}} \\ {\phi_{n}{v_{m_{2}} \otimes u_{m_{1}}}} \end{bmatrix}}.}$

For example, assuming antenna port numbering 2 for a 16 port configuration, the configuration may be given by:

${\left( {N_{1},N_{2}} \right) = {\left( {4,2} \right)\mspace{14mu} {and}}},{{v_{m_{1}} = {{\begin{bmatrix} 1 & ^{j\frac{2\pi \; m_{1}}{O_{1}N_{1}}} & ^{j\frac{4\pi \; m_{1}}{O_{1}N_{1}}} & ^{j\frac{6\pi \; m_{1}}{O_{1}N_{1}}} \end{bmatrix}^{t}\mspace{14mu} {and}\mspace{14mu} u_{m_{2}}} = \begin{bmatrix} 1 & ^{j\frac{2\pi \; m_{2}}{O_{2}N_{2}}} \end{bmatrix}^{t}}};{{{and}\mspace{14mu} \left( {N_{1},N_{2}} \right)} = {\left( {2,4} \right)\mspace{14mu} {and}}}},{v_{m_{2}} = {{\begin{bmatrix} 1 & ^{j\frac{2\pi \; m_{2}}{O_{1}N_{1}}} \end{bmatrix}^{t}\mspace{14mu} {and}\mspace{14mu} u_{m_{1}}} = {\begin{bmatrix} 1 & ^{j\frac{2\pi \; m_{1}}{O_{2}N_{2}}} & ^{j\frac{4\pi \; m_{1}}{O_{2}N_{2}}} & ^{j\frac{6\pi \; m_{1}}{O_{2}N_{2}}} \end{bmatrix}^{t}.}}}$

Similarly, for 12 port configuration, the configuration may be given by:

${\left( {N_{1},N_{2}} \right) = {\left( {3,2} \right)\mspace{14mu} {and}}},{{v_{m_{1}} = {\begin{bmatrix} 1 & ^{j\frac{2\pi \; m_{1}}{O_{1}N_{1}}} & ^{j\frac{4\pi \; m_{1}}{O_{1}N_{1}}} \end{bmatrix}^{t}\mspace{14mu} {and}\mspace{14mu} {u_{m_{2} =}\begin{bmatrix} 1 & ^{j\frac{2\pi \; m_{2}}{O_{2}N_{2}}} \end{bmatrix}}^{t}}};{{{and}\mspace{14mu} \left( {N_{1},N_{2}} \right)} = {\left( {2,3} \right)\mspace{14mu} {and}}}},{v_{m_{2}} = {{\begin{bmatrix} 1 & ^{j\frac{2\pi \; m_{2}}{O_{1}N_{1}}} \end{bmatrix}^{t}\mspace{14mu} {and}\mspace{14mu} u_{m_{1}}} = {\begin{bmatrix} 1 & ^{j\frac{2\pi \; m_{1}}{O_{2}N_{2}}} & ^{j\frac{4\pi \; m_{1}}{O_{2}N_{2}}} \end{bmatrix}^{t}.}}}$

Note that with this swapping, the dimensions of the two vectors to the left and to the right of Kronecker operator are swapped in the two expressions.

In some embodiments, v_(m) ₁

u_(m) ₂ is presented as W_(m) ₁ _(,m) ₂ . In this case, the alternate expression for rank-1 pre-coder is given by

$W_{m_{1},m_{2},n}^{(1)} = {\frac{1}{\sqrt{Q}}\begin{bmatrix} w_{m_{1},m_{2}} \\ {\phi_{n}w_{m_{1},m_{2}}} \end{bmatrix}}$

for (N₁≧N₂) and

$W_{m_{1},m_{2},n}^{(1)} = {\frac{1}{\sqrt{Q}}\begin{bmatrix} w_{m_{2},m_{1}} \\ {\phi_{n}w_{m_{2},m_{1}}} \end{bmatrix}}$

for (N₁<N₂). According to these alternatives, the expressions for rank 2-8 pre-coders are determined.

Table 4 shows four configurations for rank-2 and Table 5A and 5B show a master codebook for 2 layers CSI reporting.

TABLE 5A i₂′ 0 1 Precoder W_(s) ₁i_(1,1),s₂i_(1,2),s₁i_(1,1),s₂i_(1,2),0⁽²⁾ W_(s) ₁i_(1,1),s₂i_(1,2),s₁i_(1,1),s₂i_(1,2),1⁽²⁾ i₂′ 2 3 Precoder W_(s) ₁i_(1,1)+p₁,s₂i_(1,2),s₁i_(1,1)+p₁,s₂i_(1,2),0⁽²⁾ W_(s) ₁i_(1,1)+p₁,s₂i_(1,2),s₁i_(1,1)+p₁,s₂i_(1,2),1⁽²⁾ i₂′ 4 5 i_(1,1), i_(1,2) W_(s) ₁i_(1,1)+2p₁,s₂i_(1,2),s₁i_(1,1)+2p₁,s₂i_(1,2),0⁽²⁾ W_(s) ₁i_(1,1)+2p₁,s₂i_(1,2),s₁i_(1,1)+2p₁,s₂i_(1,2),1⁽²⁾ i₂′ 6 7 i_(1,1), i_(1,2) W_(s) ₁i_(1,1)+3p₁,s₂i_(1,2),s₁i_(1,1)+3p₁,s₂i_(1,2),0⁽²⁾ W_(s) ₁i_(1,1)+3p₁,s₂i_(1,2),s₁i_(1,1)+3p₁,s₂i_(1,2),1⁽²⁾ i₂′ 8 9 i_(1,1), i_(1,2) W_(s) ₁i_(1,1),s₂i_(1,2),s₁i_(1,1)+p₁,s₂i_(1,2),0⁽²⁾ W_(s) ₁i_(1,1),s₂i_(1,2),s₁i_(1,1)+p₁,s₂i_(1,2),1⁽²⁾ i₂′ 10 11 i_(1,1), i_(1,2) W_(s) ₁i_(1,1)+p₁,s₂i_(1,2),s₁i_(1,1)+2p₁,s₂i_(1,2),0⁽²⁾ W_(s) ₁i_(1,1)+p₁,s₂i_(1,2),s₁i_(1,1)+2p₁,s₂i_(1,2),1⁽²⁾ i₂′ 12 13 i_(1,1), i_(1,2) W_(s) ₁i_(1,1),s₂i_(1,2),s₁i_(1,1)+3p₁,s₂i_(1,2),0⁽²⁾ W_(s) ₁i_(1,1),s₂i_(1,2),s₁i_(1,1)+3p₁,s₂i_(1,2),1⁽²⁾ i₂′ 14 15 i_(1,1), i_(1,2) W_(s) ₁i_(1,1)+p₁,s₂i_(1,2),s₁i_(1,1)+3p₁,s₂i_(1,2),0⁽²⁾ W_(s) ₁i_(1,1)+p₁,s₂i_(1,2),s₁i_(1,1)+3p₁,s₂i_(1,2),1⁽²⁾

TABLE 5B i′₂ 16 17 i_(1, 1), i_(1, 2) W_(s) ₁ _(i) _(1, 1) _(, s) ₂ _(i) _(1, 2) _(+p) ₂ _(, s) ₁ _(i) _(1, 1) _(, s) ₂ _(i) _(1, 2) _(+p) ₂ _(, 0) ⁽²⁾ W_(s) ₁ _(i) _(1, 1) _(, s) ₂ _(i) _(1, 2) _(+p) ₂ _(, s) ₁ _(i) _(1, 1) _(, s) ₂ _(i) _(1, 2) _(+p) ₂ _(, 1) ⁽²⁾ i′₂ 18 19 i_(1, 1), i_(1, 2) W_(s) ₁ _(i) _(1, 1) _(+p) ₁ _(, s) ₂ _(i) _(1, 2) _(+p) ₂ _(, s) ₁ _(i) _(1, 1) _(+p) ₁ _(, s) ₂ _(i) _(1, 2) _(+p) ₂ _(, 0) ⁽²⁾ W_(s) ₁ _(i) _(1, 1) _(+p) ₁ _(, s) ₂ _(i) _(1, 2) _(+p) ₂ _(, s) ₁ _(i) _(1, 1) _(+p) ₁ _(, s) ₂ _(i) _(1, 2) _(+p) ₂ _(, 1) ⁽²⁾ i′₂ 20 21 i_(1, 1), i_(1, 2) W_(s) ₁ _(i) _(1, 1) _(+3p) ₁ _(, s) ₂ _(i) _(1, 2) _(+p) ₂ _(, s) ₁ _(i) _(1, 1) _(+3p) ₁ _(, s) ₂ _(i) _(1, 2) _(+p) ₂ _(, 0) ⁽²⁾ W_(s) ₁ _(i) _(1, 1) _(+3p) ₁ _(, s) ₂ _(i) _(1, 2) _(+p) ₂ _(, s) ₁ _(i) _(1, 1) _(+3p) ₁ _(, s) ₂ _(i) _(1, 2) _(+p) ₂ _(, 1) ⁽²⁾ i′₂ 22 23 i_(1, 1), i_(1, 2) W_(s) ₁ _(i) _(1, 1) _(, s) ₂ _(i) _(1, 2) _(+p) ₂ _(, s) ₁ _(i) _(1, 1) _(+p) ₁ _(, s) ₂ _(i) _(1, 2) _(+p) ₂ _(, 0) ⁽²⁾ W_(s) ₁ _(i) _(1, 1) _(, s) ₂ _(i) _(1, 2) _(+p) ₂ _(, s) ₁ _(i) _(1, 1) _(+p) ₁ _(, s) ₂ _(i) _(1, 2) _(+p) ₂ _(, 1) ⁽²⁾ i′₂ 24 25 i_(1, 1), i_(1, 2) W_(s) ₁ _(i) _(1, 1) _(+p) ₁ _(, s) ₂ _(i) _(1, 2) _(+p) ₂ _(, s) ₁ _(i) _(1, 1) _(+2p) ₁ _(, s) ₂ _(i) _(1, 2) _(+p) ₂ _(, 0) ⁽²⁾ W_(s) ₁ _(i) _(1, 1) _(+p) ₁ _(, s) ₂ _(i) _(1, 2) _(+p) ₂ _(, s) ₁ _(i) _(1, 1) _(+2p) ₁ _(, s) ₂ _(i) _(1, 2) _(+p) ₂ _(, 1) ⁽²⁾ i′₂ 26 27 i_(1, 1), i_(1, 2) W_(s) ₁ _(i) _(1, 1) _(+p) ₁ _(, s) ₂ _(i) _(1, 2) _(+p) ₂ _(, s) ₁ _(i) _(1, 1) _(+3p) ₁ _(, s) ₂ _(i) _(1, 2) _(+p) ₂ _(, 0) ⁽²⁾ W_(s) ₁ _(i) _(1, 1) _(+p) ₁ _(, s) ₂ _(i) _(1, 2) _(+p) ₂ _(, s) ₁ _(i) _(1, 1) _(+3p) ₁ _(, s) ₂ _(i) _(1, 2) _(+p) ₂ _(, 1) ⁽²⁾ i′₂ 28 29 i_(1, 1), i_(1, 2) W_(s) ₁ _(i) _(1, 1) _(, s) ₂ _(i) _(1, 2) _(, s) ₁ _(i) _(1, 1) _(, s) ₂ _(i) _(1, 2) _(+p) ₂ _(, 0) ⁽²⁾ W_(s) ₁ _(i) _(1, 1) _(, s) ₂ _(i) _(1, 2) _(, s) ₁ _(i) _(1, 1) _(, s) ₂ _(i) _(1, 2) _(+p) ₂ _(, 1) ⁽²⁾ i′₂ 30 31 i_(1, 1), i_(1, 2) W_(s) ₁ _(i) _(1, 1) _(+p) ₁ _(, s) ₂ _(i) _(1, 2) _(, s) ₁ _(i) _(1, 1) _(+p) ₁ _(, s) ₂ _(i) _(1, 2) _(+p) ₂ _(, 0) ⁽²⁾ W_(s) ₁ _(i) _(1, 1) _(+p) ₁ _(, s) ₂ _(i) _(1, 2) _(, s) ₁ _(i) _(1, 1) _(+p) ₁ _(, s) ₂ _(i) _(1, 2) _(+p) ₂ _(, 1) ⁽²⁾

In some embodiments, the rank-2 class A codebook is described in Table 4 and Table 5A and 5B, where i_(1,1)=0, 1, . . . , O₁N₁/s₁−1, i_(1,2)=0, 1, . . . , O₂N₂/s₂−1, and p₁=1 and p₂=1, and the pre-coder expression are given by:

${{Expression}\mspace{14mu} \left( {N_{1} \geq N_{2}} \right)},{W_{m_{1},m_{2},m_{1}^{\prime},m_{2}^{\prime},n}^{(2)} = {\frac{1}{\sqrt{2Q}}\begin{bmatrix} {v_{m_{1}} \otimes u_{m_{2}}} & {v_{m_{1}^{\prime}} \otimes u_{m_{2}^{\prime}}} \\ {\phi_{n}{v_{m_{1}} \otimes u_{m_{2}}}} & {{- \phi}\; {v_{m_{1}^{\prime}} \otimes u_{m_{2}^{\prime}}}} \end{bmatrix}}}$ ${{Expression}\mspace{14mu} \left( {N_{1} < N_{2}} \right)},{W_{m_{1},m_{2},m_{1}^{\prime},m_{2}^{\prime},n}^{(2)} = {\frac{1}{\sqrt{2Q}}\begin{bmatrix} {v_{m_{2}} \otimes u_{m_{1}}} & {v_{m_{2}^{\prime}} \otimes u_{m_{1}^{\prime}}} \\ {\phi_{n}{v_{m_{2}} \otimes u_{m_{1}}}} & {{- \phi}\; {v_{m_{2}^{\prime}} \otimes u_{m_{1}^{\prime}}}} \end{bmatrix}}}$ ${{Alternate}\mspace{14mu} {expression}\mspace{14mu} \left( {N_{1} \geq N_{2}} \right)},{W_{m_{1},m_{2},m_{1}^{\prime},m_{2}^{\prime},n}^{(2)} = {\frac{1}{\sqrt{2Q}}\begin{bmatrix} w_{m_{1},m_{2}} & w_{m_{1}^{\prime},m_{2}^{\prime}} \\ {\phi_{n}w_{m_{1},m_{2}}} & {{- \phi}\; w_{m_{1}^{\prime},m_{2}^{\prime}}} \end{bmatrix}}}$ ${{Alternate}\mspace{14mu} {expression}\mspace{14mu} \left( {N_{1} < N_{2}} \right)},{W_{m_{1},m_{2},m_{1}^{\prime},m_{2}^{\prime},n}^{(2)} = {{\frac{1}{\sqrt{2Q}}\begin{bmatrix} w_{m_{2},m_{1}} & w_{m_{2}^{\prime},m_{1}^{\prime}} \\ {\phi_{n}w_{m_{2},m_{1}}} & {{- \phi}\; w_{m_{2}^{\prime},m_{1}^{\prime}}} \end{bmatrix}}.}}$

In some embodiments, a second alternative design for Configuration 3 (described in Table 6 and Table 7) is also considered.

Table 6 shows a description of an alternative design for configuration 3 in rank-2 codebook. Table 7 shows a codebook table for alternative design for configuration 3 in rank02 codebook.

TABLE 7 i′₂ 0-19 i_(1, 1), i_(1, 2) Same as Table 5 i′₂ 20 21 i_(1, 1), i_(1, 2) W_(s) ₁ _(i) _(1, 1) _(, s) ₂ _(i) _(1, 2) _(+p) ₂ _(, s) ₁ _(i) _(1, 1) _(+3p) ₁ _(, s) ₂ _(i) _(1, 2) _(, 0) ⁽²⁾ W_(s) ₁ _(i) _(1, 1) _(, s) ₂ _(i) _(1, 2) _(+p) ₂ _(, s) ₁ _(i) _(1, 1) _(+3p) ₁ _(, s) ₂ _(i) _(1, 2) _(, 1) ⁽²⁾ i′₂ 22 23 i_(1, 1), i_(1, 2) Same as Table 5 Same as Table 5 i′₂ 24 25 i_(1, 1), i_(1, 2) W_(s) ₁ _(i) _(1, 1) _(+p) ₁ _(, s) ₂ _(i) _(1, 2) _(+p) ₂ _(, s) ₁ _(i) _(1, 1) _(+2p) ₁ _(, s) ₂ _(i) _(1, 2) _(, 0) ⁽²⁾ W_(s) ₁ _(i) _(1, 1) _(+p) ₁ _(, s) ₂ _(i) _(1, 2) _(+p) ₂ _(, s) ₁ _(i) _(1, 1) _(+2p) ₁ _(, s) ₂ _(i) _(1, 2) _(, 1) ⁽²⁾ i′₂ 26 27 i_(1, 1), i_(1, 2) W_(s) ₁ _(i) _(1, 1) _(+p) ₁ _(, s) ₂ _(i) _(1, 2) _(+p) ₂ _(, s) ₁ _(i) _(1, 1) _(+3p) ₁ _(, s) ₂ _(i) _(1, 2) _(, 0) ⁽²⁾ W_(s) ₁ _(i) _(1, 1) _(+p) ₁ _(, s) ₂ _(i) _(1, 2) _(+p) ₂ _(, s) ₁ _(i) _(1, 1) _(+3p) ₁ _(, s) ₂ _(i) _(1, 2) _(, 1) ⁽²⁾ i′₂ 28-31 i_(1, 1), i_(1, 2) Same as Table 5

FIG. 9 illustrates an example rank 3-4 orthogonal beam pair construction 900 according to embodiments of the present disclosure. An embodiment of the rank 3-4 orthogonal beam pair construction 900 shown in FIG. 9 is for illustration only. Other embodiments may be used without departing from the scope of the present disclosure. As shown in FIG. 9, the rank 3-4 orthogonal beam pair construction 900 comprises a leading beam group 905, rank 3-4 orthogonal beams for 2D antenna 910, and rank 3-4 orthogonal beams for 1D antenna 915.

In some embodiments, for rank 3-4, the codebook for a given rank value is characterized by four parameters such as {i₁₁, i₁₂, k, i₂}. Different values of parameter k are used to construct different types of orthogonal beam groups for rank 3-4 codebook. An illustration of four orthogonal beam types, indexed by k=0, 1, 2, 3, is shown in FIG. 9 and a single rank 3-4 codebooks tables are constructed for all orthogonal beam types.

Table 10 and Table 11 show the rank 3-4 codebook tables that can be used for any of Q=8, 12, and 16 antenna port configurations, where i_(1,1)=0, 1, . . . , O₁N₁/s₁−1; i_(1,2)=0, 1, . . . , O₂N₂/s₂−1; and k=0, 1, 2, 3; δ₁,δ₂ are selected from Table 10 depending on the k value.

The corresponding rank 3 pre-coder expression is given by:

Rank-3 expression (N₁≧N₂):

$W_{m_{1},m_{1}^{\prime},m_{2},m_{2}^{\prime}}^{(3)} = {\frac{1}{\sqrt{3Q}}\begin{bmatrix} {v_{m_{1}} \otimes u_{m_{2}}} & {v_{m_{1}} \otimes u_{m_{2}}} & {v_{m_{1}^{\prime}} \otimes u_{m_{2}^{\prime}}} \\ {v_{m_{1}} \otimes u_{m_{2}}} & {{- v_{m_{1}}} \otimes u_{m_{2}}} & {{- v_{m_{1}^{\prime}}} \otimes u_{m_{2}^{\prime}}} \end{bmatrix}}$ ${\overset{\sim}{W}}_{m_{1},m_{1}^{\prime},m_{2},m_{2}^{\prime}}^{(3)} = {\frac{1}{\sqrt{3Q}}\begin{bmatrix} {v_{m_{1}} \otimes u_{m_{2}}} & {v_{m_{1}^{\prime}} \otimes u_{m_{2}^{\prime}}} & {v_{m_{1}^{\prime}} \otimes u_{m_{2}^{\prime}}} \\ {v_{m_{1}} \otimes u_{m_{2}}} & {v_{m_{1}^{\prime}} \otimes u_{m_{2}^{\prime}}} & {{- v_{m_{1}^{\prime}}} \otimes u_{m_{2}^{\prime}}} \end{bmatrix}}$

Rank-3 expression (N₁<N₂):

$W_{m_{1},m_{1}^{\prime},m_{2},m_{2}^{\prime}}^{(3)} = {\frac{1}{\sqrt{3Q}}\begin{bmatrix} {v_{m_{2}} \otimes u_{m_{1}}} & {v_{m_{2}} \otimes u_{m_{1}}} & {v_{m_{2}^{\prime}} \otimes u_{m_{1}^{\prime}}} \\ {v_{m_{2}} \otimes u_{m_{1}}} & {{- v_{m_{2}}} \otimes u_{m_{1}}} & {{- v_{m_{2}^{\prime}}} \otimes u_{m_{1}^{\prime}}} \end{bmatrix}}$ ${{\overset{\sim}{W}}_{m_{1},m_{1}^{\prime},m_{2},m_{2}^{\prime}}^{(3)} = {\frac{1}{\sqrt{3Q}}\begin{bmatrix} {v_{m_{2}} \otimes u_{m_{1}}} & {v_{m_{2}^{\prime}} \otimes u_{m_{1}^{\prime}}} & {v_{m_{2}^{\prime}} \otimes u_{m_{1}^{\prime}}} \\ {v_{m_{2}} \otimes u_{m_{1}}} & {v_{m_{2}^{\prime}} \otimes u_{m_{1}^{\prime}}} & {{- v_{m_{2}^{\prime}}} \otimes u_{m_{1}^{\prime}}} \end{bmatrix}}};$

Alternate rank-3 expression (N₁≧N₂):

$W_{m_{1},m_{1}^{\prime},m_{2},m_{2}^{\prime}}^{(3)} = {\frac{1}{\sqrt{3Q}}\begin{bmatrix} w_{m_{1},m_{2}} & w_{m_{1},m_{2}} & w_{m_{1}^{\prime},m_{2}^{\prime}} \\ w_{m_{1},m_{2}} & {- w_{m_{1},m_{2}}} & {- w_{m_{1}^{\prime},m_{2}^{\prime}}} \end{bmatrix}}$ ${\overset{\sim}{W}}_{m_{1},m_{1}^{\prime},m_{2},m_{2}^{\prime}}^{(3)} = {\frac{1}{\sqrt{3Q}}\begin{bmatrix} w_{m_{1},m_{2}} & w_{m_{1}^{\prime},m_{2}^{\prime}} & w_{m_{1}^{\prime},m_{2}^{\prime}} \\ w_{m_{1},m_{2}} & w_{m_{1}^{\prime},m_{2}^{\prime}} & {- w_{m_{1}^{\prime},m_{2}^{\prime}}} \end{bmatrix}}$

Alternate rank-3 expression (N₁<N₂):

$W_{m_{1},m_{1}^{\prime},m_{2},m_{2}^{\prime}}^{(3)} = {\frac{1}{\sqrt{3Q}}\begin{bmatrix} w_{m_{2},m_{1}} & w_{m_{2},m_{1}} & w_{m_{2}^{\prime},m_{1}^{\prime}} \\ w_{m_{2},m_{1}} & {- w_{m_{2},m_{1}}} & {- w_{m_{2}^{\prime},m_{1}^{\prime}}} \end{bmatrix}}$ ${\overset{\sim}{W}}_{m_{1},m_{1}^{\prime},m_{2},m_{2}^{\prime}}^{(3)} = {{\frac{1}{\sqrt{3Q}}\begin{bmatrix} w_{m_{2},m_{1}} & w_{m_{2}^{\prime},m_{1}^{\prime}} & w_{m_{2}^{\prime},m_{1}^{\prime}} \\ w_{m_{2},m_{1}} & w_{m_{2}^{\prime},m_{1}^{\prime}} & {- w_{m_{2}^{\prime},m_{1}^{\prime}}} \end{bmatrix}}.}$

The corresponding rank 4 pre-coder expression is given by:

Rank-4 expression (N₁≧N₂):

$W_{m_{1},m_{1}^{\prime},m_{2},m_{2}^{\prime},n}^{(4)} = {\frac{1}{\sqrt{4Q}}{\quad\begin{bmatrix} {v_{m_{1}} \otimes u_{m_{2}}} & {v_{m_{1}^{\prime}} \otimes u_{m_{2}^{\prime}}} & {v_{m_{1}} \otimes u_{m_{2}}} & {v_{m_{1}^{\prime}} \otimes u_{m_{2}^{\prime}}} \\ {\phi_{n}{v_{m_{1}} \otimes u_{m_{2}}}} & {\phi_{n}{v_{m_{1}^{\prime}} \otimes u_{m_{2}^{\prime}}}} & {{- \phi_{n}}{v_{m_{1}} \otimes u_{m_{2}}}} & {{- \phi_{n}}{v_{m_{1}^{\prime}} \otimes u_{m_{2}^{\prime}}}} \end{bmatrix}}}$

Rank-4 expression (N₁<N₂):

$W_{m_{1},m_{1}^{\prime},m_{2},m_{2}^{\prime},n}^{(4)} = {\frac{1}{\sqrt{4Q}}{\quad\begin{bmatrix} {v_{m_{2}} \otimes u_{m_{1}}} & {v_{m_{2}^{\prime}} \otimes u_{m_{1}^{\prime}}} & {v_{m_{2}} \otimes u_{m_{1}}} & {v_{m_{2}^{\prime}} \otimes u_{m_{1}^{\prime}}} \\ {\phi_{n}{v_{m_{2}} \otimes u_{m_{1}}}} & {\phi_{n}{v_{m_{2}^{\prime}} \otimes u_{m_{1}^{\prime}}}} & {{- \phi_{n}}{v_{m_{2}} \otimes u_{m_{1}}}} & {{- \phi_{n}}{v_{m_{2}^{\prime}} \otimes u_{m_{1}^{\prime}}}} \end{bmatrix}}}$

Alternate rank-4 expression (N₁≧N₂):

$W_{m_{1},m_{1}^{\prime},m_{2},m_{2}^{\prime},n}^{(4)} = {\frac{1}{\sqrt{4Q}}{\quad\begin{bmatrix} w_{m_{1},m_{2}} & w_{m_{1}^{\prime},m_{2}^{\prime}} & w_{m_{1},m_{2}} & w_{m_{1}^{\prime},m_{2}^{\prime}} \\ {\phi_{n}w_{m_{1},m_{2}}} & {\phi_{n}w_{m_{1}^{\prime},m_{2}^{\prime}}} & {{- \phi_{n}}w_{m_{1},m_{2}}} & {{- \phi_{n}}w_{m_{1}^{\prime},m_{2}^{\prime}}} \end{bmatrix}}}$

Alternate rank-4 expression (N₁<N₂):

$W_{m_{1},m_{1}^{\prime},m_{2},m_{2}^{\prime},n}^{(4)} = {\frac{1}{\sqrt{4Q}}{\quad{\begin{bmatrix} w_{m_{2},m_{1}} & w_{m_{2}^{\prime},m_{1}^{\prime}} & w_{m_{2},m_{1}} & w_{m_{2}^{\prime},m_{1}^{\prime}} \\ {\phi_{n}w_{m_{2},m_{1}}} & {\phi_{n}w_{m_{2}^{\prime},m_{1}^{\prime}}} & {{- \phi_{n}}w_{m_{2},m_{1}}} & {{- \phi_{n}}w_{m_{2}^{\prime},m_{1}^{\prime}}} \end{bmatrix}.}}}$

Table 8 shows orthogonal beam type to (δ₁, δ₂) mapping and Table 9 shows an alternate orthogonal beam type to (δ₁, δ₂) mapping.

TABLE 8 k δ 0 1 2 3 If N₁ > 1 and N₂ > 1 δ₁ O₁ 0 O₁ (N₁ − 1)O₁ δ₂ 0  O₂ O₂ 0 If N₂ = 1 δ₁ O₁ 2O₁ 3O₁  (N₁ − 1)O₁ δ₂ 0 0 0 0

TABLE 9 k δ 0 1 2 3 4 5 6 7 If N₁ > 1 δ₁ O₁ 0 O₁ 2O₁ 0  O₁ 2O₁ 2O₁ and N₂ > 1 δ₂ 0  O₂ O₂ 0 2O₂ 2O₂  O₂ 2O₂ If N₂ = 1 δ₁ O₁ 2O₁ 3O₁  δ₂ 0 0 0

Table 10 shows a codebook for 3 layers CSI reporting and Table 11 shows a codebook for 4 layers CSI reporting.

TABLE 10 i′₂ 0 1 i_(1, 1), i_(1, 2), k W_(s) ₁ _(i) _(1, 1) _(, s) ₁ _(i) _(1, 1) _(+δ) ₁ _(, s) ₂ _(i) _(1, 2) _(, s) ₂ _(i) _(1, 2) _(+δ) ₂ ⁽³⁾ W_(s) ₁ _(i) _(1, 1) _(+δ) ₁ _(, s) ₁ _(i) _(1, 1) _(, s) ₂ _(i) _(1, 2) _(+δ) ₂ _(, s) ₂ _(i) _(1, 2) ⁽³⁾ i′₂ 2 3 i_(1, 1), i_(1, 2), k {tilde over (W)}_(s) ₁ _(i) _(1, 1) _(, s) ₁ _(i) _(1, 1) _(+δ) ₁ _(, s) ₂ _(i) _(1, 2) _(, s) ₂ _(i) _(1, 2) _(+δ) ₂ ⁽³⁾ {tilde over (W)}_(s) ₁ _(i) _(1, 1) _(+δ) ₁ _(, s) ₁ _(i) _(1, 1) _(, s) ₂ _(i) _(1, 2) _(+δ) ₂ _(, s) ₂ _(i) _(1, 2) ⁽³⁾ i′₂ 4 5 i_(1, 1), i_(1, 2), k W_(s) ₁ _(i) _(1, 1) _(+p) ₁ _(, s) ₁ _(i) _(1, 1) _(+p) ₁ _(+δ) ₁ _(, s) ₂ _(i) _(1, 2) _(, s) ₂ _(i) _(1, 2) _(+δ) ₂ ⁽³⁾ W_(s) ₁ _(i) _(1, 1) _(+p) ₁ _(+δ) ₁ _(, s) ₁ _(i) _(1, 1) _(+p) ₁ _(, s) ₂ _(i) _(1, 2) _(+δ) ₂ _(, s) ₂ _(i) _(1, 2) ⁽³⁾ i′₂ 6 7 i_(1, 1), i_(1, 2), k {tilde over (W)}_(s) ₁ _(i) _(1, 1) _(+p) ₁ _(, s) ₁ _(i) _(1, 1) _(+p) ₁ _(+δ) ₁ _(, s) ₂ _(i) _(1, 2) _(, s) ₂ _(i) _(1, 2) _(+δ) ₂ ⁽³⁾ {tilde over (W)}_(s) ₁ _(i) _(1, 1) _(+p) ₁ _(+δ) ₁ _(, s) ₁ _(i) _(1, 1) _(+p) ₁ _(, s) ₂ _(i) _(1, 2) _(+δ) ₂ _(, s) ₂ _(i) _(1, 2) ⁽³⁾ i′₂ 8 9 i_(1, 1), i_(1, 2), k W_(s) ₁ _(i) _(1, 1) _(+2p) ₁ _(, s) ₁ _(i) _(1, 1) _(+2p) ₁ _(+δ) ₁ _(, s) ₂ _(i) _(1, 2) _(, s) ₂ _(i) _(1, 2) _(+δ) ₂ ⁽³⁾ W_(s) ₁ _(i) _(1, 1) _(+2p) ₁ _(+δ) ₁ _(, s) ₁ _(i) _(1, 1) _(+2p) ₁ _(, s) ₂ _(i) _(1, 2) _(+δ) ₂ _(, s) ₂ _(i) _(1, 2) ⁽³⁾ i′₂ 10 11 i_(1, 1), i_(1, 2), k {tilde over (W)}_(s) ₁ _(i) _(1, 1) _(+2p) ₁ _(, s) ₁ _(i) _(1, 1) _(+2p) ₁ _(+δ) ₁ _(, s) ₂ _(i) _(1, 2) _(, s) ₂ _(i) _(1, 2) _(+δ) ₂ ⁽³⁾ {tilde over (W)}_(s) ₁ _(i) _(1, 1) _(+2p) ₁ _(+δ) ₁ _(, s) ₁ _(i) _(1, 1) _(+2p) ₁ _(, s) ₂ _(i) _(1, 2) _(+δ) ₂ _(, s) ₂ _(i) _(1, 2) ⁽³⁾ i′₂ 12 13 i_(1, 1), i_(1, 2), k W_(s) ₁ _(i) _(1, 1) _(+3p) ₁ _(, s) ₁ _(i) _(1, 1) _(+3p) ₁ _(+δ) ₁ _(, s) ₂ _(i) _(1, 2) _(, s) ₂ _(i) _(1, 2) _(+δ) ₂ ⁽³⁾ W_(s) ₁ _(i) _(1, 1) _(+3p) ₁ _(+δ) ₁ _(, s) ₁ _(i) _(1, 1) _(+3p) ₁ _(, s) ₂ _(i) _(1, 2) _(+δ) ₂ _(, s) ₂ _(i) _(1, 2) ⁽³⁾ i′₂ 14 15 i_(1, 1), i_(1, 2), k {tilde over (W)}_(s) ₁ _(i) _(1, 1) _(+3p) ₁ _(, s) ₁ _(i) _(1, 1) _(+3p) ₁ _(+δ) ₁ _(, s) ₂ _(i) _(1, 2) _(, s) ₂ _(i) _(1, 2) _(+δ) ₂ ⁽³⁾ {tilde over (W)}_(s) ₁ _(i) _(1, 1) _(+3p) ₁ _(+δ) ₁ _(, s) ₁ _(i) _(1, 1) _(+3p) ₁ _(, s) ₂ _(i) _(1, 2) _(+δ) ₂ _(, s) ₂ _(i) _(1, 2) ⁽³⁾ i′₂ 16-31 i_(1, 1), i_(1, 2), k Entries 16-31 constructed with replacing s₂i_(1, 2) in third and fourth subscripts with s₂i_(1, 2) + p₂ in entries 0-15.

TABLE 11 i′₂ 0 1 i_(1, 1), i_(1, 2), k W_(s) ₁ _(i) _(1, 1) _(, s) ₁ _(i) _(1, 1) _(+δ) ₁ _(, s) ₂ _(i) _(1, 2) _(, s) ₂ _(i) _(1, 2) _(+δ) ₂ _(, 0) ⁽⁴⁾ W_(s) ₁ _(i) _(1, 1) _(, s) ₁ _(i) _(1, 1) _(+δ) ₁ _(, s) ₂ _(i) _(1, 2) _(, s) ₂ _(i) _(1, 2) _(+δ) ₂ _(, 1) ⁽⁴⁾ i′₂ 2 3 i_(1, 1), i_(1, 2), k W_(s) ₁ _(i) _(1, 1) _(+p) ₁ _(, s) ₁ _(i) _(1, 1) _(+p) ₁ _(+δ) ₁ _(, s) ₂ _(i) _(1, 2) _(, s) ₂ _(i) _(1, 2) _(+δ) ₂ _(, 0) ⁽⁴⁾ W_(s) ₁ _(i) _(1, 1) _(+p) ₁ _(, s) ₁ _(i) _(1, 1) _(+p) ₁ _(+δ) ₁ _(, s) ₂ _(i) _(1, 2) _(, s) ₂ _(i) _(1, 2) _(+δ) ₂ _(, 1) ⁽⁴⁾ i′₂ 4 5 i_(1, 1), i_(1, 2), k W_(s) ₁ _(i) _(1, 1) _(+2p) ₁ _(, s) ₁ _(i) _(1, 1) _(+2p) ₁ _(+δ) ₁ _(, s) ₂ _(i) _(1, 2) _(, s) ₂ _(i) _(1, 2) _(+δ) ₂ _(, 0) ⁽⁴⁾ W_(s) ₁ _(i) _(1, 1) _(+2p) ₁ _(, s) ₁ _(i) _(1, 1) _(+2p) ₁ _(+δ) ₁ _(, s) ₂ _(i) _(1, 2) _(, s) ₂ _(i) _(1, 2) _(+δ) ₂ _(, 1) ⁽⁴⁾ i′₂ 6 7 i_(1, 1), i_(1, 2), k W_(s) ₁ _(i) _(1, 1) _(+3p) ₁ _(, s) ₁ _(i) _(1, 1) _(+3p) ₁ _(+δ) ₁ _(, s) ₂ _(i) _(1, 2) _(, s) ₂ _(i) _(1, 2) _(+δ) ₂ _(, 0) ⁽⁴⁾ W_(s) ₁ _(i) _(1, 1) _(+3p) ₁ _(, s) ₁ _(i) _(1, 1) _(+3p) ₁ _(+δ) ₁ _(, s) ₂ _(i) _(1, 2) _(, s) ₂ _(i) _(1, 2) _(+δ) ₂ _(, 1) ⁽⁴⁾ i′₂ 8-15 i_(1, 1), i_(1, 2), k Entries 8-15 constructed with replacing s₂i_(1, 2) in third and fourth subscripts with s₂i_(1, 2) + p₂ in entries 0-7.

FIG. 10 illustrates an example orthogonal beam 1000 for rank 3-4 according to embodiments of the present disclosure. An embodiment of the orthogonal beam 1000 for rank 3-4 shown in FIG. 10 is for illustration only. Other embodiments may be used without departing from the scope of the present disclosure. As shown in FIG. 10, the orthogonal beam 1000 for rank 3-4 comprises a configuration 1 1005, a configuration 2 1010, a configuration 3 1015, and a configuration 4 1020.

In some embodiments, a UE is configured with a beam group configuration from four configurations, namely the configuration 1 1005, the configuration 2 1010, the configuration 3 1015, and the configuration 4 1020, for codebook subset selection on mater rank 3-4 codebooks. For k=0, an illustration of the four configurations is shown FIG. 10. Depending on the configuration, the UE selects i₂′ indices (in Table 10 and Table 11) according to Table 12 and Table 13 for rank 3 and rank 4, respectively, for PMI reporting. The parameters (s₁,s₂) and (p₁,p₂) for the four configurations are shown in Table 12 and Table 13.

Table 12 shows selected i₂′ indices for rank-3 CSI reporting and Table 13 shows selected i₂′ indices for rank-4 CSI reporting.

TABLE 12 Configuration Selected i₂′ indices (s1, s2) (p₁, p₂) 1 0, 2 (1, 1) (—, —) 2 0-7, 16-23 (O₁, O₂) $\left( {\frac{O_{1}}{2},\frac{O_{2}}{2}} \right)$ 3 0-3, 8-11, 20-23, 28-31 (O₁, O₂) $\left( {\frac{O_{1}}{4},\frac{O_{2}}{2}} \right)$ 4 0-15 $\left( {O_{1},\frac{O_{2}}{2}} \right)$ $\left( {\frac{O_{1}}{4},—} \right)$

TABLE 13 Configuration Selected i₂′ indices (s1, s2) (p₁, p₂) 1 0, 1 (1, 1) (—, —) 2 0-3, 8-11 (O₁, O₂) $\left( {\frac{O_{1}}{2},\frac{O_{2}}{2}} \right)$ 3 0-1, 4-5, 10-11, 14-15 (O₁, O₂) $\left( {\frac{O_{1}}{4},\frac{O_{2}}{2}} \right)$ 4 0-7 $\left( {O_{1},\frac{O_{2}}{2}} \right)$ $\left( {\frac{O_{1}}{4},—} \right)$

Note that p₁=s₁/L₁ for the configurations 2-4, where L₁ is the number of included beam indices along the first dimension of the master codebook. In other words, for the configurations 2-4, the effective oversampling is kept fixed for rank 3-4.

In some embodiments, a UE is configured with a second alternative design for a configuration 3 in rank 3-4 codebook, which is described in Table 14. Table 14 shows a description of alternative design for the configuration 3 in rank 3-4 codebook.

In some embodiments, a UE feeds back k in PMI as part of W1 indication. In particular, k is jointly encoded with i₁ indication(s) or (i_(1,1), i_(1,2)) indication. In some embodiments, a UE is configured with a k value. In some embodiments, there are two alternatives for the number of values of k. In one example, two values: k=0,1 as shown in Table 9. In another example, maximum eight values are determined if N₁>1 and N₂>1: k=0, 1, 2 . . . , 7 as shown in Table 9. In yet another example, maximum eight values are determined if N₂=1: k=0, 1, 2 as shown in Table 9. In such example, a UE may be configured with at least one of examples.

In some embodiments, a UE is configured with rank 3-4 codebook tables as shown in Table 10 and Table 11 with (s₁, s₂) and (p₁, p₂) parameters according to Table 15. In one example, Table 15 may be applicable to oversampling factors O₁, O₂=4, 8, 16, etc. In another example, Table 15 may be applicable to a number of antenna ports Q=8, 12, 16, etc.

Note that Table 15 is for N₁≧N₂ case. For N₁<N₂, the parameter table is obtained by swapping the dimension indices (1, 2) with (2, 1) in Table 15.

TABLE 15 Antenna port configuration Configuration (s₁, s₂) (p₁, p₂) If N₁ > 1 and N₂ > 1 1 (1, 1) (−, −) 2 $\left( {\frac{O_{1}}{2},\frac{O_{2}}{2}} \right)$ $\left( {\frac{O_{1}}{4},\frac{O_{2}}{4}} \right)$ 3 $\left( {O_{1},\frac{O_{2}}{2}} \right)$ $\left( {\frac{O_{1}}{4},\frac{O_{2}}{2}} \right)$ 4 $\left( {O_{1},\frac{O_{2}}{4}} \right)$ $\left( {\frac{O_{1}}{4}, -} \right)$ N₂ = 1 4 (O₁, −) $\left( {\frac{O_{1}}{4}, -} \right)$

The motivation behind this choice of parameters is to have the same effective oversampling factor for configuration=2, 3, 4. For instance, an effective oversampling factor for the parameters in Table 15 is (4, 4), which is the same as the effective oversampling factor in LTE specification codebook. As an example, if O₁=O₂=8, then corresponding beam indices are 0, 2, 4, 6, etc. in the two dimensions. In one example for configuration 2, in both dimensions, beams (0, 2) form one beam group, beams (4, 6) form the next beam group, and so on. In another example for configuration 3, in 1st dimension, beams (0, 2, 4, 6) form one beam group, beams (8, 10, 12, 14) form the next beam group, and so on, and in 2nd dimension, beams (0, 2) form one beam group, beams (4, 6) form the next beam group, and so on. In yet another example for configuration 4, in 1st dimension, beams (0, 2, 4, 6) form one beam group, beams (8, 10, 12, 14) form the next beam group, and so on, and in 2nd dimension, beam 0 forms one beam group, beam 2 forms the next beam group, and so on. Note that the effective oversampling factor is maintained at (O₁, O₂) for configuration 1.

In some embodiments, a UE is configured with rank 3-4 codebook tables as shown in Table 10 and Table 11 with (s₁, s₂) and (p₁, p₂) parameters according to Table 16, which corresponds to effective oversampling factors the same as the configured oversampling factors. Table 16 shows (s₁,s₂) and (p₁,p₂) parameters for rank 3-4 codebook for N₁≧N₂.

TABLE 16 Antenna port configuration Configuration (s₁, s₂) (p₁, p₂) If N₁ > 1 and N₂ > 1 1 (1, 1) (—, —) 2 (2, 2) (1, 1) 3 (4, 2) 4 (4, 1) N₂ = 1 4  (4, —)  (1, —)

In some embodiments, a UE is configured with rank 3-4 codebook tables in Table 10 and 11 with (s₁, s₂) and (p₁, p₂) parameters the same as in the rank 1-2 codebook. In this case, the parameters are given by Table 17. Table 17 shows (s₁, s₂) and (p₁, p₂) parameters for rank 3-4 codebook for N₁≧N₂

TABLE 17 Antenna port configuration Configuration (s₁, s₂) (p₁, p₂) If N₁ > 1 and N₂ > 1 1 (1, 1) (—, —) 2-4 (2, 2) (1, 1) N₂ = 1 4  (2, —)  (1, —)

In some embodiments, for rank 5-8, the proposed codebooks are characterized by two parameters such as {i₁₁, i₁₂}. Consequently, only W1 feedback applies. For rank 5, 6, 7, 8, the precoding matrices are as in the following, where δ_(1,1), δ_(1,2), δ_(1,3), δ_(2,1), δ_(2,2), δ_(2,3) are determined by the RRC ‘Config’ parameter that can take values 1, 2, 3, 4.

Rank-5 expression (N₁≧N₂),

${W_{i_{1,1},i_{1,2}}^{(5)} = {\frac{1}{\sqrt{5\; Q}}\begin{bmatrix} {m\; 1} & {m\; 1} & {m\; 3} & {m\; 3} & {m\; 5} \\ {m\; 1} & {m\; 2} & {m\; 3} & {m\; 4} & {m\; 5} \end{bmatrix}}},$

where m1=v_(s) ₁ _(i) _(1,1)

u_(s) ₂ _(i) _(1,2) , m2=−v_(s) ₁ _(i) _(1,1)

u_(s) ₂ _(i) _(1,2) , m3=v_(s) ₁ _(i) _(1,1) _(+δ) _(1,1)

u_(s) ₂ _(i) _(1,2) _(+δ) _(2,1) , m4=−v_(s) ₁ _(i) _(1,1) _(+δ) _(1,1)

u_(s) ₂ _(i) _(1,2) _(+δ) _(2,1) , and m5=v_(s) ₁ _(i) _(1,1) _(+δ) _(1,2)

u_(s) ₂ _(i) _(1,2) _(+δ) _(2,2) .

Rank-5 expression (N₁<N₂),

${W_{i_{1,1},i_{1,2}}^{(5)} = {\frac{1}{\sqrt{5\; Q}}\begin{bmatrix} {m\; 6} & {m\; 6} & {m\; 8} & {m\; 8} & {m\; 10} \\ {m\; 6} & {m\; 7} & {m\; 8} & {m\; 9} & {m\; 10} \end{bmatrix}}},$

where m6=v_(s) ₂ _(i) _(1,2)

u_(s) ₁ _(i) _(1,1) , m7=−v_(s) ₂ _(i) _(1,2)

u_(s) ₁ _(i) _(1,1) , m8=v_(s) ₂ _(i) _(1,2) _(+δ) _(2,1)

u_(s) ₁ _(i) _(1,1) _(+δ) _(1,1) , m9=−v_(s) ₂ _(i) _(1,2) _(+δ) _(1,1)

u_(s) ₁ _(i) _(1,1) _(+δ) _(2,1) , and m10=v_(s) ₂ _(i) _(1,2) _(+δ) _(2,2)

u_(s) ₁ _(i) _(1,1) _(+δ) _(1,2) .

Rank-6 expression (N₁≧N₂),

${W_{i_{1,1},i_{1,2}}^{(6)} = {\frac{1}{\sqrt{6\; Q}}\begin{bmatrix} {m\; 1} & {m\; 1} & {m\; 3} & {m\; 3} & {m\; 5} & {m\; 5} \\ {m\; 1} & {m\; 2} & {m\; 3} & {m\; 4} & {m\; 5} & {m\; 11} \end{bmatrix}}},$

where m11=−v_(s) ₁ _(i) _(1,1) _(+δ) _(1,2)

u_(s) ₂ _(i) _(1,2) _(+δ) _(2,2) .

Rank-6 expression (N₁<N₂),

${W_{i_{1,1},i_{1,2}}^{(6)} = {\frac{1}{\sqrt{6\; Q}}\begin{bmatrix} {m\; 6} & {m\; 6} & {m\; 8} & {m\; 8} & {m\; 10} & {m\; 10} \\ {m\; 6} & {m\; 7} & {m\; 8} & {{m\; 9}\;} & {m\; 10} & {m\; 12} \end{bmatrix}}},$

where m12=−v_(s) ₂ _(i) _(1,2) _(+δ) _(2,2)

u_(s) ₁ _(i) _(1,1) _(+δ) _(1,2) .

Rank-7 expression (N₁≧N₂),

${W_{i_{1,1},i_{1,2}}^{(7)} = {\frac{1}{\sqrt{7\; Q}}\begin{bmatrix} {m\; 1} & {m\; 1} & {m\; 3} & {m\; 3} & {m\; 5} & {m\; 5} & {m\; 13} \\ {m\; 1} & {m\; 2} & {m\; 3} & {m\; 4} & {m\; 5} & {m\; 11} & {m\; 13} \end{bmatrix}}},$

where m13=−v_(s) ₁ _(i) _(1,1) _(+δ) _(1,3)

u_(s) ₂ _(i) _(1,2) _(+δ) _(2,3) .

Rank-7 expression (N₁<N₂),

${W_{i_{1,1},i_{1,2}}^{(7)} = {\frac{1}{\sqrt{7\; Q}}\begin{bmatrix} {m\; 6} & {m\; 6} & {m\; 8} & {m\; 8} & {m\; 10} & {m\; 10} & {m\; 14} \\ {m\; 6} & {m\; 7} & {m\; 8} & {m\; 9} & {m\; 10} & {m\; 12} & {m\; 14} \end{bmatrix}}},$

where m14=v_(s) ₂ _(i) _(1,2) _(+δ) _(2,3)

u_(s) ₁ _(i) _(1,1) _(+δ) _(1,3) .

Rank-8 expression (N₁≧N₂),

${W_{i_{1,1},i_{1,2}}^{(8)} = {\frac{1}{\sqrt{8\; Q}}\begin{bmatrix} {m\; 1} & {m\; 1} & {m\; 3} & {m\; 3} & {m\; 5} & {m\; 5} & {m\; 15} & {m\; 15} \\ {m\; 1} & {m\; 2} & {m\; 3} & {m\; 4} & {m\; 5} & {m\; 11} & {m\; 15} & {m\; 13} \end{bmatrix}}},$

where m15=v_(s) ₁ _(i) _(1,1) _(+δ) _(1,3)

u_(s) ₂ _(i) _(1,2) _(+δ) _(2,3) .

Rank-8 expression (N₁<N₂),

${W_{i_{1,1},i_{1,2}}^{(8)} = {\frac{1}{\sqrt{8\; Q}}\begin{bmatrix} {m\; 6} & {m\; 6} & {m\; 8} & {m\; 8} & {m\; 10} & {m\; 10} & {m\; 14} & {m\; 14} \\ {m\; 6} & {m\; 7} & {m\; 8} & {m\; 9} & {m\; 10} & {m\; 12} & {m\; 14} & {m\; 16} \end{bmatrix}}},$

where m16=−v_(s) ₂ _(i) _(1,2) _(+δ) _(2,3)

u_(s) ₁ _(i) _(1,1) _(+δ) _(1,3) .

Alternate rank-5 expression (N₁≧N₂),

${W_{i_{1,1},i_{1,2}}^{(5)} = {\frac{1}{\sqrt{5\; Q}}\begin{bmatrix} {n\; 1} & {n\; 1} & {n\; 3} & {n\; 3} & {n\; 5} \\ {n\; 1} & {n\; 2} & {n\; 3} & {n\; 4} & {n\; 5} \end{bmatrix}}},$

where n1=w_(s) ₁ _(i) _(1,1) _(,s) ₂ _(i) _(1,2) , n2=−w_(s) ₁ _(i) _(1,1) _(,s) ₂ _(i) _(1,2) , n3=w_(s) ₁ _(i) _(1,1) _(+δ) _(1,1) _(,s) ₂ _(i) _(1,2) _(+δ) _(2,1) , n4=−w_(s) ₁ _(i) _(1,1) _(+δ) _(1,1) _(,s) ₂ _(i) _(1,2) _(+δ) _(2,1) , and n5=w_(s) ₁ _(i) _(1,1) _(+δ) _(1,2) _(,s) ₂ _(i) _(1,2) _(+δ) _(2,2) .

Alternate rank-5 expression (N₁<N₂),

${W_{i_{1,1},i_{1,2}}^{(5)} = {\frac{1}{\sqrt{5\; Q}}\begin{bmatrix} {n\; 6} & {n\; 6} & {n\; 8} & {n\; 8} & {n\; 10} \\ {n\; 6} & {n\; 7} & {n\; 8} & {n\; 9} & {n\; 10} \end{bmatrix}}},$

where n6=w_(s) ₂ _(i) _(1,2) _(,s) ₁ _(i) _(1,1) , n7=−w_(s) ₂ _(i) _(1,2) _(,s) ₁ _(i) _(1,1) , n8=w_(s) ₂ _(i) _(1,2) _(+δ) _(2,1) _(,s) ₁ _(i) _(1,1) _(+δ) _(1,1) , n9=−w_(s) ₂ _(i) _(1,2) _(+δ) _(1,1) _(,s) ₁ _(i) _(1,1) _(+δ) _(2,1) , and n10=w_(s) ₂ _(i) _(1,2) _(+δ) _(2,2) _(,s) ₁ _(i) _(1,1) _(+δ) _(1,2) .

Alternate rank-6 expression (N₁≧N₂),

${W_{i_{1,1},i_{1,2}}^{(6)} = {\frac{1}{\sqrt{6\; Q}}\begin{bmatrix} {n\; 1} & {n\; 1} & {n\; 3} & {n\; 3} & {n\; 5} & {n\; 5} \\ {n\; 1} & {n\; 2} & {n\; 3} & {n\; 4} & {n\; 5} & {n\; 11} \end{bmatrix}}},$

where n11=−w_(s) ₁ _(i) _(1,1) _(+δ) _(1,2) _(,s) ₂ _(i) _(1,2) _(+δ) _(2,2) .

Alternate rank-6 expression (N₁<N₂),

${W_{i_{1,1},i_{1,2}}^{(6)} = {\frac{1}{\sqrt{6\; Q}}\begin{bmatrix} {n\; 6} & {n\; 6} & {n\; 8} & {n\; 8} & {n\; 10} & {n\; 10} \\ {n\; 6} & {n\; 7} & {n\; 8} & {n\; 9} & {n\; 10} & {n\; 12} \end{bmatrix}}},$

where n12=−w_(s) ₂ _(i) _(1,2) _(+δ) _(2,2) _(,s) ₁ _(i) _(1,1) _(+δ) _(1,2) .

Alternate rank-7 expression (N₁≧N₂),

${W_{i_{1,1},i_{1,2}}^{(7)} = {\frac{1}{\sqrt{7\; Q}}\begin{bmatrix} {n\; 1} & {n\; 1} & {n\; 3} & {n\; 3} & {n\; 5} & {n\; 5} & {n\; 13} \\ {n\; 1} & {n\; 2} & {n\; 3} & {n\; 4} & {n\; 5} & {n\; 11} & {n\; 13} \end{bmatrix}}},$

where n13=−w_(s) ₁ _(i) _(1,1) _(+δ) _(1,3) _(,s) ₂ _(i) _(1,2) _(+δ) _(2,3) .

Alternate rank-7 expression (N₁<N₂),

${W_{i_{1,1},i_{1,2}}^{(7)} = {\frac{1}{\sqrt{7\; Q}}\begin{bmatrix} {n\; 6} & {n\; 6} & {n\; 8} & {n\; 8} & {n\; 10} & {n\; 10} & {n\; 14} \\ {n\; 6} & {n\; 7} & {n\; 8} & {n\; 9} & {n\; 10} & {n\; 12} & {n\; 14} \end{bmatrix}}},$

where n14=w_(s) ₂ _(i) _(1,2) _(+δ) _(2,3) _(,s) ₁ _(i) _(1,1) _(+δ) _(1,3) .

Alternate rank-8 expression (N₁≧N₂),

${W_{i_{1,1},i_{1,2}}^{(8)} = {\frac{1}{\sqrt{8\; Q}}\begin{bmatrix} {n\; 1} & {n\; 1} & {n\; 3} & {n\; 3} & {n\; 5} & {n\; 5} & {n\; 13} & {n\; 13} \\ {n\; 1} & {n\; 2} & {n\; 3} & {n\; 4} & {n\; 5} & {n\; 11} & {n\; 13} & {n\; 15} \end{bmatrix}}},$

where n15=w_(s) ₁ _(i) _(1,1) _(+δ) _(1,3) _(,s) ₂ _(i) _(1,2) _(+δ) _(2,3) .

Alternate rank-8 expression (N₁<N₂),

${W_{i_{1,1},i_{1,2}}^{(8)} = {\frac{1}{\sqrt{8\; Q}}\begin{bmatrix} {n\; 6} & {n\; 6} & {n\; 8} & {n\; 8} & {n\; 10n\; 10\; n\; 14n\; 14} \\ {n\; 6} & {n\; 7} & {n\; 8} & {n\; 9} & {n\; 10n\; 12\; n\; 14n\; 16} \end{bmatrix}}},$

where n16=−w_(s) ₂ _(i) _(1,2) _(+δ) _(2,3) _(,s) ₁ _(i) _(1,1) _(+δ) _(1,3) .

FIG. 11 illustrates an example orthogonal beam grouping 1100 for rank 5-8 according to embodiments of the present disclosure. An embodiment of the orthogonal beam grouping 1100 for rank 5-8 shown in FIG. 11 is for illustration only. Other embodiments may be used without departing from the scope of the present disclosure. As shown in FIG. 11, the orthogonal beam grouping 1100 comprises beams in the second dim 1105 and beams in the first dim 1110.

In some embodiments, as shown in FIG. 11, for 8 ports 2D case, there is only one orthogonal beam type which corresponds to Config=2 for rank 5-8 codebook, and is parameterized by δ_(1,1), δ_(1,2), δ_(1,3), δ_(2,1), δ_(2,2), δ_(2,3) values given in Table 18. In this case, the UE always maps the configuration parameter to configuration (e.g., config)=2 as shown in FIG. 11, regardless of the value of the “Config” parameter. Table 18 shoes delta values for 8-port rank 5-8 codebooks.

TABLE 18 Antenna configu- ration δ_(1, 1) δ_(2, 1) δ_(1, 2) δ_(2, 2) δ_(1, 3) δ_(2, 3) Configuration = 2 (2, 2) O₁ 0 O₁ O₂ 0 O₂

FIG. 12 illustrates another example orthogonal beam grouping 1200 for rank 5-8 according to embodiments of the present disclosure. An embodiment of the orthogonal beam grouping 1200 for rank 5-8 shown in FIG. 12 is for illustration only. Other embodiments may be used without departing from the scope of the present disclosure. As shown in FIG. 12, the orthogonal beam grouping 1200 comprises config=1 and config=2 1205, a config=3 1210, and a config=4 1215.

FIG. 13 illustrates yet another example orthogonal beam grouping 1300 for rank 5-8 according to embodiments of the present disclosure. An embodiment of the orthogonal beam grouping 1300 for rank 5-8 shown in FIG. 13 is for illustration only. Other embodiments may be used without departing from the scope of the present disclosure. As shown in FIG. 13, the orthogonal beam grouping 1300 comprises config=1 and config=2 1305, a config=3 1310, and a config=4 1315.

FIG. 14 illustrates yet another example orthogonal beam grouping 1400 for rank 5-8 according to embodiments of the present disclosure. An embodiment of the orthogonal beam grouping 1400 for rank 5-8 shown in FIG. 14 is for illustration only. Other embodiments may be used without departing from the scope of the present disclosure. As shown in FIG. 14, the orthogonal beam grouping 1400 comprises config=1 and config=2 1405, a config=3 1410, and a config=4 1415.

FIG. 15 illustrates yet another example orthogonal beam grouping 1500 for rank 5-8 according to embodiments of the present disclosure. An embodiment of the orthogonal beam grouping 1500 for rank 5-8 shown in FIG. 15 is for illustration only. Other embodiments may be used without departing from the scope of the present disclosure. As shown in FIG. 15, the orthogonal beam grouping 1500 comprises config=1 and config=2 1505, a config=3 1510, and a config=4 1515.

In some embodiments, as shown in FIG. 12, FIG. 13, FIG. 14, and FIG. 15, there are three orthogonal beam type configurations indexed by Config=1, 2, 3, 4 for rank 5-8 codebook, which are parameterized by δ_(1,1), δ_(1,2), δ_(1,3), δ_(2,1), δ_(2,2), δ_(2,3) values. Note that Config=1 and Config=2 corresponds to the same beam group. There are two alternatives for Config 3, which are shown in FIG. 12 and FIG. 13 for 12 ports, and in FIG. 14, and FIG. 15 for 16 ports. For 12 ports, δ_(1,2), δ_(1,3), δ_(2,1), δ_(2,2), δ_(2,3) are defined in Table 19, and for 16 ports they are defined in Table 20. Table 18 shows delta values for 12-port rank 5-8 codebooks.

TABLE 19 Antenna configu- ration δ_(1, 1) δ_(2, 1) δ_(1, 2) δ_(2, 2) δ_(1, 3) δ_(2, 3) Config = 4 N₁ ≧ N₂ O₁ 0 2O₁  0 0 O₂ N₁ < N₂ 0 O₂ 0 2O₂  O₁ 0 Config = 3, Alt 1 N₁ ≧ N₂ O₁ 0 2O₁  0 O₁ O₂ N₁ < N₂ 0 O₂ 0 2O₂  O₁ O₂ Config = 3, Alt 2 N₁ ≧ N₂ O₁ 0 O₁ O₂ 2O₁  O₂ N₁ < N₂ 0 O₂ O₁ O₂ O₁ 2O₂  Config = 1, Both O₁ 0 O₁ O₂ 0 O₂ Config = 2

Table 19 shows delta values for 16-port rank 5-8 codebooks

TABLE 20 Antenna configu- ration δ_(1, 1) δ_(2, 1) δ_(1, 2) δ_(2, 2) δ_(1, 3) δ_(2, 3) Config = 4 N₁ ≧ N₂ O₁ 0 2O₁ 0 3O₁ 0 N₁ < N₂ 0 O₂ 0 2O₂ 0 3O₂ Config = 3, Alt 1 N₁ ≧ N₂ O₁ O₂ 2O₁ 0 3O₁  O₂ N₁ < N₂ O₁ O₂ 0 2O₂ 0 3O₂ Config = 3, Alt 2 N₁ ≧ N₂ O₁ 0 2O₁  O₂ 3O₁  O₂ N₁ < N₂ 0 O₂  O₁ 2O₂  O₁ 3O₂ Config = 1, Both O₁ 0  O₁  O₂ 0  O₂ Config = 2

In some embodiments, (s₁, s₂) values for rank 5-8 codebook is given by Table 21 or Table 22. For N₁<N₂, (s₁, s₂) parameters are swapped if Table 21 is used. Note that for N₂=1, we have only Config 4. Table 21 shows (s₁, s₂) parameters for rank 5-8 codebook for N₁≧N₂.

TABLE 21 (s₁, s₂) i_(1, 1) i_(1, 1) If N₁ > 1 and N₂ > 1 Config 4    (2, O₂/2) 0-3 0-3 Config 1, (O₁, O₂/2) Config 2 Config 3 (O₁, O₂/2) If N₂ = 1 Config 4 Alt 1: (2, —) — — Alt 2: (O₁, —) Alt 3: (O₁/2, —)

Table 22 shows (s₁, s₂) parameters for rank 5-8 codebook.

TABLE 22 (s₁, s₂) i_(1, 1) i_(1, 1) If N₁ > 1 and N₂ > 1 Config 4 (O₁N₁/4, O₂N₂/4) 0-3 0-3 Config 1, Config 2 Config 3 If N₂ = 1 Config 4 (O₁N₁/4, —)   0-3 —

In some embodiments, a UE is configured with rank 5-8 codebook tables with the same effective oversampling factor, i.e., (4,4), for Config 1-4, which is aligned with rank 3-4 codebook parameter in Table 15 and also with LTE specification codebook. Accordingly, for 8 antenna ports, (s₁, s₂) parameters for rank 5-8 codebook are given by Table 23. There may be two alternatives for i_(1,1) (or i_(1,2)). In one example, i_(1,1) (or i_(1,2))=0-3, in which redundant i_(1,1) (or i_(1,2))=4-7 due to phase wrap around are not included. In another example, i_(1,1) (or i_(1,2))=0-3, in which redundant i_(1,1) (or i_(1,2))=4-7 due to phase wrap around are included. The aforementioned examples may be used in future when N₁ (or N₂)>2. Table 23 shows (s₁, s₂) parameters for rank 5-8 codebook for N₁≧N₂: 8 ports.

TABLE 23 i_(1, 1) i_(1, 2) (s₁, s₂) (2 bits) (2 bits) If N₁ > 1 and N₂ > 1 Config 2 (O₁/4, O₂/4) Alt 1: 0-3 Alt 1: 0-3 Alt 2: 0-7 Alt 2: 0-7

For 12 and 16 antenna ports, (s₁, s₂) parameters are given by Table 24. Note that there may be two options for 1D case (N₂=1). In one example, an effective oversampling is 4. In another example, an effective oversampling is the configured oversampling factor O₁. Similar to 8 port case, the aforementioned examples are allowed for i_(1,2) in case of Config 1-3. Table 24 shows (s₁,s₂) parameters for rank 5-8 codebook: N₁≧N₂: 12, 16 ports.

TABLE 24 (s₁, s₂) i_(1, 1) i_(1, 2) If N₁ > 1 Config 4 (O₁/4, O₂/4) 0−(O₁N₁/s₁−1) → 0-7 and N₂ > 1 0−(4N₁−1) Config 1-3 i.e., 0-11 for Alt 1: 0-3 12 ports Alt 2: 0-7 0-15 for 16 ports If N₂ = 1 Config 4 Option 1: Option 1: — (O₁/4, —) 0−(4N₁−1) Option 2: Option 2: (1, —) 0−(O₁N₁−1)

In some embodiments, a UE is configured with rank 5-8 codebook tables with the same (s₁, s₂) parameters such that the effective oversampling factor is the same as configured oversampling factors, i.e., according to Table 25. Again, two alternatives are allowed for i_(1,2) in case of Config 1-3. Table 25 shows (s₁, s₂) parameters for rank 5-8 codebook: N₁≧N₂: 12, 16 ports.

TABLE 25 (s₁, s₂) i_(1, 1) i_(1, 2) If N₁ > 1 Config 4 (1, 1)  0−(O₁N₁−1) 0−(O₂N₂−1) and N₂ > 1 Config 1-3 Alt 1: 0−(O₂N₂/2−1) Alt 2: 0−(O₂N₂−1) If N₂ = 1 Config 4 (1, —) 0−(O₁N₁−1) —

In some embodiments, a UE is configured with rank 5-8 codebook tables with the (s₁, s₂) parameters such that the choice of parameter is constrained to use of the same number of (i_(1,1), i_(1,2)) bits regardless of the Config parameter. For instance, if i_(1,1) and i_(1,2) are constrained to be 2 bits each, then the rank 5-8 codebook parameters are given by Table 26 for both 12 and 16 antenna ports. Note that there may be two options for Config 1-3 in Table 26. In one example, a leading beam index of orthogonal beam groups is a multiple of O₁ for both 12 and 16 antenna ports (i.e., N₁=3 and 4). In another example, a leading beam index of orthogonal beam groups depends on the value of N₁, i.e., it is a multiple of N₁. For instance, for 12 antenna ports, the leading beam index is a multiple of 6, and for 16 antenna ports, the leading beam index is a multiple of 8. Table 26 shows (s₁, s₂) parameters for rank 5-8 codebook for N₁≧N₂: 12, 16 ports.

TABLE 26 i_(1, 1) i_(1, 2) (s₁, s₂) (2 bits) (2 bits) If N₁ > 1 Config 4 (O₁/4, O₂/2) 0-3 0-3 and N₂ > 1 Config 1-3 Option 1: Option 1: 0-2 (O₁, O₂/4) (12 ports) Option 2: 0-3 (O₁N₁/4, O₂/4) (16 ports) Option 2: 0-3 If N₂ = 1 Config 4 (O₁N₁/4, —)   0-3 —

Note that the above (s₁, s₂) parameter tables is for N₁≧N₂ case. For N₁<N₂, the parameter table is obtained by swapping the dimension subscripts (1, 2) with (2, 1).

In some embodiments, the KP expressions can be swapped for the two configurations, i.e., if N₁≧N₂,

${W_{m_{1},m_{2},n}^{(1)} = {\frac{1}{\sqrt{Q}}\begin{bmatrix} {u_{m_{2}} \otimes v_{m_{1}}} \\ {\phi_{n}{u_{m_{2}} \otimes v_{m_{1}}}} \end{bmatrix}}};$

and if N₁<N₂,

$W_{m_{1},m_{2},n}^{(1)} = {{\frac{1}{\sqrt{Q}}\begin{bmatrix} {u_{m_{1}} \otimes v_{m_{2}}} \\ {\phi_{n}{u_{m_{1}} \otimes v_{m_{2}}}} \end{bmatrix}}.}$

The aforementioned expressions may be applied various embodiments of the present disclosure for other ranks as well.

In some embodiments, the codebook table is parameterized with a parameter pair (d₁, d₂) which takes a value (d₁, d₂)=(1, 2) if N₁≧N₂ and a value (d₁, d₂)=(2, 1) if N₁<N₂. In this case, the master rank-1 codebook is given by Table 27A and 27B, where

${W_{m_{d_{1}},m_{d_{2}},n}^{(1)} = {\frac{1}{\sqrt{Q}}\begin{bmatrix} {v_{m_{d_{1}}} \otimes u_{m_{d_{2}}}} \\ {\phi_{n}{v_{m_{d_{1}}} \otimes u_{m_{d_{2}}}}} \end{bmatrix}}},{v_{m_{d_{1}}} = \begin{bmatrix} 1 & ^{j\frac{2\pi \; m_{d_{1}}}{O_{d_{1}}N_{d_{1}}}} & ^{j\frac{4\pi \; m_{d_{1}}}{O_{d_{1}}N_{d_{1}}}} & ^{j\frac{6\pi \; m_{d_{1}}}{O_{d_{1}}N_{d_{1}}}} \end{bmatrix}^{t}},{and}$ $u_{m_{d_{2}}} = {\begin{bmatrix} 1 & ^{j\frac{2\pi \; m_{d_{2}}}{O_{d_{2}}N_{d_{2}}}} \end{bmatrix}^{t}.}$

Table 27A and 27B show a master codebook for 1 layer CSI reporting (e.g., parameterized).

TABLE 27A i₂′ 0 1 Precoder W_(s_(d₁)i_(1, d₁), s_(d₂)i_(1, d₂), 0)⁽¹⁾ W_(s_(d₁)i_(1, d₁), s_(d₂)i_(1, d₂), 1)⁽¹⁾ i₂′ 2 3 Precoder W_(s_(d₁)i_(1, d₁), s_(d₂)i_(1, d₂), 2)⁽¹⁾ W_(s_(d₁)i_(1, d₁), s_(d₂)i_(1, d₂), 3)⁽¹⁾ i₂′ 4 5 Precoder W_(s_(d₁)i_(1, d₁) + 1, s_(d₂)i_(1, d₂), 0)⁽¹⁾ W_(s_(d₁)i_(1, d₁) + 1, s_(d₂)i_(1, d₂), 1)⁽¹⁾ i₂′ 6 7 Precoder W_(s_(d₁)i_(1, d₁) + 1, s_(d₂)i_(1, d₂), 2)⁽¹⁾ W_(s_(d₁)i_(1, d₁) + 1, s_(d₂)i_(1, d₂), 3)⁽¹⁾

TABLE 27B i′₂ 8 9 Precoder W_(s_(d₁)i_(1, d₁) + 2, s_(d₂)i_(1, d₂), 0)⁽¹⁾ W_(s_(d₁)i_(1, d₁) + 2, s_(d₂)i_(1, d₂), 1)⁽¹⁾ i′₂ 10 11 Precoder W_(s_(d₁)i_(1, d₁) + 2, s_(d₂)i_(1, d₂), 2)⁽¹⁾ W_(s_(d₁)i_(1, d₁) + 2, s_(d₂)i_(1, d₂), 3)⁽¹⁾ i′₂ 12 13 Precoder W_(s_(d₁)i_(1, d₁) + 3, s_(d₂)i_(1, d₂), 0)⁽¹⁾ W_(s_(d₁)i_(1, d₁) + 3, s_(d₂)i_(1, d₂), 1)⁽¹⁾ i′₂ 14 15 Precoder W_(s_(d₁)i_(1, d₁) + 3, s_(d₂)i_(1, d₂), 2)⁽¹⁾ W_(s_(d₁)i_(1, d₁) + 3, s_(d₂)i_(1, d₂), 3)⁽¹⁾ i′₂ 16-31 Precoder Entries 16-31 constructed with replacing the second     subscript  _(s_(d₂)i_(1, d₂))  with  _(s_(d₂)i_(1, d₂) + 1)  in  entries  0-15.

For rank 2-8, the parameterized master codebook can be constructed similarly.

In some embodiments, the order in which the Kronecker product is performed is dependent on the configuration. For instance, for the configuration in which N₁≧N₂, the UE derives the rank-1 pre-coder as

${W_{m_{1},m_{2},n}^{(1)} = {\frac{1}{\sqrt{Q}}\begin{bmatrix} {v_{m_{1}} \otimes u_{m_{2}}} \\ {\phi_{n}{v_{m_{1}} \otimes u_{m_{2}}}} \end{bmatrix}}},$

and for the configuration in which N₁<N₂, the UE derives the rank-1 pre-coder as

$W_{m_{1},m_{2},n}^{(1)} = {{\frac{1}{\sqrt{Q}}\begin{bmatrix} {u_{m_{2}} \otimes v_{m_{1}}} \\ {\phi_{n}{u_{m_{2}} \otimes v_{m_{1}}}} \end{bmatrix}}.}$

Note that the orders in which the Kronecker product is performed in the two expressions are opposite in order to ensure that the dimensions of the two vectors to the left and to the right of Kronecker operator are the same in the two expressions.

Also note that in some embodiments the KP expressions can be swapped for the two configurations, i.e., if N₁≧N₂,

$W_{m_{1},m_{2},n}^{(1)} = {\frac{1}{\sqrt{Q}}\begin{bmatrix} {u_{m_{2}} \otimes v_{m_{1}}} \\ {\phi_{n}{u_{m_{2}} \otimes v_{m_{1}}}} \end{bmatrix}}$

and if N₁<N₂,

$W_{m_{1},m_{2},n}^{(1)} = {{\frac{1}{\sqrt{Q}}\begin{bmatrix} {v_{m_{1}} \otimes u_{m_{2}}} \\ {\phi_{n}{v_{m_{1}} \otimes u_{m_{2}}}} \end{bmatrix}}.}$

The aforementioned expression may be applied to various embodiments of the present disclosure for other ranks as well.

For example, assuming antenna port numbering 2 for a 16 port configuration, the two expressions are given by:

${\left( {N_{1},N_{2}} \right) = {\left( {4,2} \right)\mspace{14mu} {and}}},{v_{m_{1}} = {\begin{bmatrix} 1 & ^{j\frac{2\pi \; m_{1}}{O_{1}N_{1}}} & ^{j\frac{4\pi \; m_{1}}{O_{1}N_{1}}} & ^{j\frac{6\pi \; m_{1}}{O_{1}N_{1}}} \end{bmatrix}^{t}\mspace{14mu} {and}}}$ ${{u_{m_{2}} = \begin{bmatrix} 1 & ^{j\frac{2\pi \; m_{2}}{O_{2}N_{2}}} \end{bmatrix}^{t}};{{{and}\mspace{14mu} \left( {N_{1},N_{2}} \right)} = {\left( {2,4} \right)\mspace{14mu} {and}}}},{v_{m_{1}} = {{\begin{bmatrix} 1 & ^{j\frac{2\pi \; m_{1}}{O_{1}N_{1}}} \end{bmatrix}^{t}\mspace{14mu} {and}\mspace{14mu} u_{m_{2}}} = {\begin{bmatrix} 1 & ^{j\frac{2\pi \; m_{2}}{O_{2}N_{2}}} & ^{j\frac{4\pi \; m_{2}}{O_{2}N_{2}}} & ^{j\frac{6\pi \; m_{2}}{O_{2}N_{2}}} \end{bmatrix}^{t}.}}}$

Similarly, for 12 port configuration, the two expressions are given by:

(N₁, N₂) = (3, 2), and $v_{m_{1}} = {\begin{bmatrix} 1 & ^{j\frac{2\pi \; m_{1}}{O_{1}N_{1}}} & ^{j\frac{4\pi \; m_{1}}{O_{1}N_{1}}} \end{bmatrix}^{t}\mspace{14mu} {and}}$ ${u_{m_{2}} = \begin{bmatrix} 1 & ^{j\frac{2\pi \; m_{2}}{O_{2}N_{2}}} \end{bmatrix}^{t}},{{{and}\mspace{14mu} \left( {N_{1},N_{2}} \right)} = \left( {2,3} \right)},\mspace{14mu} {and}$ $v_{m_{1}} = {{\begin{bmatrix} 1 & ^{j\frac{2\pi \; m_{1}}{O_{1}N_{1}}} \end{bmatrix}^{t}\mspace{14mu} {and}\mspace{14mu} u_{m_{2}}} = {\begin{bmatrix} 1 & ^{j\frac{2\pi \; m_{2}}{O_{2}N_{2}}} & ^{j\frac{4\pi \; m_{2}}{O_{2}N_{2}}} \end{bmatrix}^{t}.}}$

The aforementioned embodiment is applicable to the antenna port numbering 1, where (N₁, N₂)=(2, 4) for config A and for (N₁, N₂)=(4, 2) for config B. Note that even though W_(m) ₁ _(,m) ₂ _(,n) expression is different in two configurations, the master rank-1 codebook table such as Table 2 can be used for both.

For rank-2, the pre-coding matrix is given by

$W_{m_{1},m_{2},m_{1}^{\prime},m_{2}^{\prime},n}^{(2)} = {\frac{1}{\sqrt{2Q}}\begin{bmatrix} {v_{m_{1}} \otimes u_{m_{2}}} & {v_{m_{1}}^{\prime} \otimes u_{m_{2}}^{\prime}} \\ {\phi_{n}{v_{m_{1}} \otimes u_{m_{2}}}} & {{- \phi_{n}}{v_{m_{1}}^{\prime} \otimes u_{m_{2}}^{\prime}}} \end{bmatrix}}$

for N₁≧N₂ (config A) and

$W_{m_{1},m_{2},m_{1}^{\prime},m_{2}^{\prime},n}^{(2)} = {\frac{1}{\sqrt{2Q}}\begin{bmatrix} {u_{m_{2}} \otimes v_{m_{1}}} & {u_{m_{2}}^{\prime} \otimes v_{m_{1}}^{\prime}} \\ {\phi_{n}{u_{m_{2}} \otimes v_{m_{1}}}} & {{- \phi_{n}}{u_{m_{2}}^{\prime} \otimes v_{m_{1}}^{\prime}}} \end{bmatrix}}$

for N₁<N₂ (config B).

The expressions for rank 3-8 for the two configurations can be expression similarly. Similar to rank-1, for rank 2-8 also, the master rank 2-8 codebooks in this case remain the same as aforementioned earlier in the present disclosure.

In addition, the beam grouping schemes or (L₁, L₂) configurations or codebook subset selection according to some embodiments of the present disclosure are applicable straightforwardly to this case once the master table for each of antenna port configurations is implemented.

In some embodiments, if the oversampling factor in the longer and shorter dimensions of the two symmetric port configurations is the same, then the pre-coder for one of the symmetric port configuration is derived from that for the other symmetric port configuration by applying a fixed mapping on the elements of the pre-coding vector.

In one embodiment, for the configuration in which N₁≧N₂ (config A), the UE derives the rank-1 pre-coder as

${W_{m_{1},m_{2},n}^{(1)} = {\frac{1}{\sqrt{Q}}\begin{bmatrix} {v_{m_{1}} \otimes u_{m_{2}}} \\ {\phi_{n}{v_{m_{1}} \otimes u_{m_{2}}}} \end{bmatrix}}},$

and for the configuration in which N₁<N₂ (config B), the UE derives the rank-1 pre-coder as

${W_{m_{1},m_{2},n}^{(1)} = {\frac{1}{\sqrt{Q}}\begin{bmatrix} {\sigma \left( {v_{m_{1}} \otimes u_{m_{2}}} \right)} \\ {\phi_{n}{\sigma \left( {v_{m_{1}} \otimes u_{m_{2}}} \right)}} \end{bmatrix}}},$

where the mapping function is defined as

${\sigma \begin{pmatrix} a_{0} \\ a_{1} \\ \vdots \\ a_{N_{2} - 1} \\ b_{0} \\ b_{1} \\ \vdots \\ b_{N_{2} - 1} \end{pmatrix}} = \begin{pmatrix} a_{0} \\ b_{0} \\ a_{1} \\ b_{1} \\ a_{2} \\ \vdots \\ a_{N_{2} - 1} \\ b_{N_{2} - 1} \end{pmatrix}$

Note that here the assumption is that O₁ and O₂ in case of N₁≧N₂ is the same as O₂ and O₁ in case of N₁<N₂, respectively.

In one example, for (N₁,N₂)=(4, 2) with (O₁,O₂)=(8, 16),

${v_{m_{1}} = {\left\lbrack {1\mspace{14mu} ^{j\frac{2\pi \; n_{1}}{32}}\mspace{14mu} ^{{j\frac{4\pi \; n_{1}}{32}}\;}\mspace{14mu} ^{j\frac{6\pi \; n_{1}}{32}}} \right\rbrack^{t}\mspace{14mu} {and}}}\mspace{14mu}$ ${u_{m_{2}} = \left\lbrack {1\mspace{14mu} ^{j\frac{2\pi \; n_{2}}{32}}} \right\rbrack^{t}},$

hence

${{v_{m_{1}} \otimes u_{m_{2}}} = \left\lbrack {1\mspace{20mu} ^{j\frac{2\pi \; n_{2}}{32}}\mspace{14mu} ^{j\frac{2\pi \; n_{1}}{32}}\mspace{14mu} ^{{j2\pi}\; {n_{2}{(\frac{m_{1} + m_{2}}{32})}}}\mspace{14mu} ^{j\frac{4\pi \; n_{1}}{32}}\mspace{14mu} ^{{j2\pi}\; {(\frac{{2m_{1}} + m_{2}}{32})}}\mspace{14mu} ^{j\frac{6\pi \; n_{1}}{32}}\mspace{14mu} ^{{j2\pi}\; {(\frac{{3m_{1}} + m_{2}}{32})}}} \right\rbrack};$

and for (N₁,N₂)=(2,4) with (O₁,O₂)=(16,8),

${v_{m_{2}} = {{\left\lbrack {1\mspace{14mu} ^{j\frac{2\pi \; n_{2}}{32}}} \right\rbrack^{t}\mspace{14mu} {and}\mspace{14mu} u_{m_{1}}} = \left\lbrack {1\mspace{14mu} ^{j\frac{2\pi \; n_{1}}{32}}\mspace{14mu} ^{{j\frac{4\pi \; n_{1}}{32}}\;}\mspace{14mu} ^{j\frac{6\pi \; n_{1}}{32}}} \right\rbrack^{t}}},$

hence

${v_{m_{2}} \otimes u_{m_{1}}} = {\quad \left\lbrack {{1\mspace{20mu} ^{j\frac{2\pi \; n_{1}}{32}}\mspace{14mu} ^{j\frac{4\pi \; n_{1}}{32}}\mspace{14mu} ^{j\frac{6\pi \; n_{1}}{32}}\left. \quad\mspace{14mu} {^{j\frac{2\pi \; n_{2}}{32}}\mspace{14mu} ^{{j2\pi}\; {(\frac{m_{1} + m_{2}}{32})}}\mspace{14mu} ^{{j2\pi}\; {(\frac{{2m_{1}} + m_{2}}{32})}}\mspace{14mu} ^{{j2\pi}\; {(\frac{{3m_{1}} + m_{2}}{32})}}} \right\rbrack},} \right.}$

which can be obtained by applying the permutation σ({1 2 3 4 5 6 7 8})={1 3 5 7 2 4 6 8} on the components of

$\left\lbrack {1\mspace{20mu} ^{j\frac{2\pi \; n_{2}}{32}}\mspace{14mu} ^{j\frac{2\pi \; n_{1}}{32}}\mspace{14mu} ^{{j2\pi}\; {(\frac{m_{1} + m_{2}}{32})}}{\left. \quad\mspace{14mu} {^{j\frac{4\pi \; n_{1}}{32}}\mspace{14mu} ^{{j2\pi}\; {(\frac{{2m_{1}} + m_{2}}{32})}}\mspace{14mu} ^{j\frac{6\pi \; n_{1}}{32}}\mspace{14mu} ^{{j2\pi}\; {(\frac{{3m_{1}} + m_{2}}{32})}}} \right\rbrack.}} \right.$

In another embodiment, the pre-coder for N₁≧N₂ can be derived by applying a similar fixed mapping on the pre-coder for N₁<N₂ case. For rank 2-8, the mapping can be constructed similarly.

Although the present disclosure has been described with an exemplary embodiment, various changes and modifications may be suggested to one skilled in the art. It is intended that the present disclosure encompass such changes and modifications as fall within the scope of the appended claims.

None of the description in this application should be read as implying that any particular element, step, or function is an essential element that must be included in the claims scope. The scope of patented subject matter is defined only by the claims. Moreover, none of the claims are intended to invoke 35 U.S.C. §112(f) unless the exact words “means for” are followed by a participle. 

What is claimed is:
 1. A user equipment (UE) in a wireless communication system, the UE comprising: a transceiver configured to receive, from an eNodeB (eNB), downlink signals indicating precoder codebook parameters that include a first number of antenna ports (N₁) for a first dimension, a second number of antenna ports (N₂) for a second dimension, a first oversampling factor (O₁) for the first dimension, a second oversampling factor (O₂) for the second dimension, and a codebook configuration; and at least one processor configured to swap precoder matrix indicator (PMI) expressions based on the N₁ and N₂, and the codebook configuration in order to derive a first PMI pair (i_(1,1), i_(1,2)), and a second PMI (i₂) using a single precoder codebook, wherein the transceiver is further configured to transmit, to the eNB, channel state information (CSI) including the first PMI pair and the second PMI.
 2. The UE of claim 1, wherein the at least one processor is further configured to: identify a pair of parameters comprising (d₁, d₂) based on the N₁ and N₂; and parameterize a codebook table based on the identified pair of parameters (d₁, d₂).
 3. The UE of claim 2, wherein the (d₁, d₂) are defined as at least one of: (d₁, d₂)=(1, 2) when the N₁ is greater or equal to the N₂; or (d₁, d₂)=(2, 1) when the N₁ is less than the N₂.
 4. The UE of claim 1, wherein the at least one processor is further configured to determine dummy variables including x and y based on a pair of parameters comprising (d₁, d₂) in accordance with the N₁ and N₂, the dummy variables being determined as: x=i_(1,d1) and y=i_(1,d2).
 5. The UE of claim 1, wherein the swapped PMI expressions in a rank 1 codebook and a rank 2 codebook for a codebook configuration 3 and a codebook configuration 4 comprise an order of (m₁, m₂) based on the N₁ and N₂, and wherein m₁ is an index of a first discrete fourier transform (DFT) vector representing a beam for the first dimension, m₂ is an index of a second DFT vector representing a beam for the second dimension, and (m₁, m₂) is an index pair of a two-dimensional DFT vector (w_(m) ₁ _(,m) ₂ ) representing a beam, $w_{m_{1},m_{2}} = {\left\lbrack {u_{m_{2}}\mspace{14mu} ^{j\frac{2\pi \; m_{1}}{O_{1}N_{1}}}\mspace{14mu} u_{m_{2}}\ldots \mspace{14mu} ^{j\frac{2\pi \; {m_{1}{({N_{1} - 1})}}}{O_{1}N_{1}}}\mspace{14mu} u_{m_{2}}} \right\rbrack^{T}\mspace{14mu} {where}}$ $u_{m_{2}} = {\left\lbrack {1\mspace{14mu} ^{j\frac{2\pi \; m_{2}}{O_{2}N_{2}}}\mspace{11mu} \ldots \mspace{14mu} ^{j\frac{2\pi \; {m_{2}{({N_{2} - 1})}}}{O_{2}N_{2}}}} \right\rbrack.}$
 6. The UE of claim 5, wherein the order of (m₁, m₂) is defined as at least one of: (m₁, m₂) when the N₁ is greater than or equal to the N₂; or (m₂, m₁) when the N₁ is less than the N₂.
 7. The UE of claim 6, wherein, when the N₁ is greater than or equal to the N₂, a rank 1 precoder based on the swapped PMI expressions is determined as: ${W_{m_{1},m_{2},n}^{(1)} = {\frac{1}{\sqrt{Q}}\begin{bmatrix} w_{m_{1},m_{2}} \\ {\phi_{n}w_{m_{1},m_{2}}} \end{bmatrix}}};$ and a rank 2 precoder based on the swapped PMI expressions is determined as: ${W_{m_{1},m_{2},m_{1}^{\prime},m_{2}^{\prime},n}^{(2)} = {\frac{1}{\sqrt{2Q}}\begin{bmatrix} w_{m_{1},m_{2}} & w_{m_{1}^{\prime},m_{2}^{\prime}} \\ {\phi_{n}w_{m_{1},m_{2}}} & {{- \phi_{n}}w_{m_{1}^{\prime},m_{2}^{\prime}}} \end{bmatrix}}};$ and when the N₁ is less than the N₂, a rank 1 precoder based on the swapped PMI expressions is determined as: ${W_{m_{1},m_{2},n}^{(1)} = {\frac{1}{\sqrt{Q}}\begin{bmatrix} w_{m_{2},m_{1}} \\ {\phi_{n}w_{m_{2},m_{1}}} \end{bmatrix}}};$ and a rank 2 precoder based on the swapped PMI expressions is determined as: ${W_{m_{1},m_{2},m_{1}^{\prime},m_{2}^{\prime},n}^{(2)} = {\frac{1}{\sqrt{2Q}}\begin{bmatrix} w_{m_{2},m_{1}} & w_{m_{2}^{\prime},m_{1}^{\prime}} \\ {\varphi_{n}w_{m_{2},m_{1}}} & {{- \varphi_{n}}w_{m_{2}^{\prime},m_{1}^{\prime}}} \end{bmatrix}}},$ where Q=2N₁N₂ and φ_(n)=e^(jπn/2).
 8. The UE of claim 4, wherein a rank-1 codebook for a codebook configuration 3 is determined based on the dummy variables including the x and y according to a following codebook table: i₂ i_(1,1) i_(1,2) 0 1 2 3 $0,1,\ldots \mspace{11mu},{\frac{N_{1}O_{1}}{2} - 1}$ $0,1,\ldots \mspace{11mu},{\frac{N_{2}O_{2}}{2} - 1}$ W_(2x,2y,0) ⁽¹⁾ W_(2x,2y,1) ⁽¹⁾ W_(2x,2y,2) ⁽¹⁾ W_(2x,2y,3) ⁽¹⁾ i₂ i_(1,1) i_(1,2) 4 5 6 7 $0,1,\ldots \mspace{11mu},{\frac{N_{1}O_{1}}{2} - 1}$ $0,1,\ldots \mspace{11mu},{\frac{N_{2}O_{2}}{2} - 1}$ W_(2x+2,2y,0) ⁽¹⁾ W_(2x+2,2y,1) ⁽¹⁾ W_(2x+2,2y,2) ⁽¹⁾ W_(2x+2,2y,3) ⁽¹⁾ i₂ i_(1,1) i_(1,2) 8 9 10 11 $0,1,\ldots \mspace{11mu},{\frac{N_{1}O_{1}}{2} - 1}$ $0,1,\ldots \mspace{11mu},{\frac{N_{2}O_{2}}{2} - 1}$ W_(2x+1,2y+1,0) ⁽¹⁾ W_(2x+1,2y+1,1) ⁽¹⁾ W_(2x+1,2y+1,2) ⁽¹⁾ W_(2x+1,2y+1,3) ⁽¹⁾ i₂ i_(1,1) i_(1,2) 12 13 14 15 $0,1,\ldots \mspace{11mu},{\frac{N_{1}O_{1}}{2} - 1}$ $0,1,\ldots \mspace{11mu},{\frac{N_{2}O_{2}}{2} - 1}$ W_(2x+3,2y+1,0) ⁽¹⁾ W_(2x+3,2y+1,1) ⁽¹⁾ W_(2x+3,2y+1,2) ⁽¹⁾ W_(2x+3,2y+1,3) ⁽¹⁾ ${{{where}\mspace{14mu} x} = i_{1,1}},{y = i_{1,2}},{W_{l,m,n}^{(1)} = {\frac{1}{\sqrt{P}}\begin{bmatrix} v_{l,m} \\ {\phi_{n}v_{l,m}} \end{bmatrix}}},{{{if}\mspace{14mu} N_{1}} \geq N_{2}}$ ${x = i_{1,2}},{y = i_{1,1}},{W_{l,m,n}^{(1)} = {\frac{1}{\sqrt{P}}\begin{bmatrix} v_{m,l} \\ {\phi_{n}v_{m,l}} \end{bmatrix}}},{{{if}\mspace{14mu} N_{1}} < N_{2}}$

and the rank-1 codebook for a codebook configuration 4 is determined based on the dummy variables including the x and y according to a following codebook table: i₂ i_(1,1) i_(1,2) 0 1 2 3 $0,1,\ldots \mspace{11mu},{\frac{N_{1}O_{1}}{2} - 1}$ $0,1,\ldots \mspace{11mu},{\frac{N_{2}O_{2}}{2} - 1}$ W_(2x,2y,0) ⁽¹⁾ W_(2x,2y,1) ⁽¹⁾ W_(2x,2y,2) ⁽¹⁾ W_(2x,2y,3) ⁽¹⁾ i₂ i_(1,1) i_(1,2) 4 5 6 7 $0,1,\ldots \mspace{11mu},{\frac{N_{1}O_{1}}{2} - 1}$ $0,1,\ldots \mspace{11mu},{\frac{N_{2}O_{2}}{2} - 1}$ W_(2x+1,2y,0) ⁽¹⁾ W_(2x+1,2y,1) ⁽¹⁾ W_(2x+1,2y,2) ⁽¹⁾ W_(2x+1,2y,3) ⁽¹⁾ i₂ i_(1,1) i_(1,2) 8 9 10 11 $0,1,\ldots \mspace{11mu},{\frac{N_{1}O_{1}}{2} - 1}$ $0,1,\ldots \mspace{11mu},{\frac{N_{2}O_{2}}{2} - 1}$ W_(2x+2,2y,0) ⁽¹⁾ W_(2x+2,2y,1) ⁽¹⁾ W_(2x+2,2y,2) ⁽¹⁾ W_(2x+2,2y,3) ⁽¹⁾ i₂ i_(1,1) i_(1,2) 12 13 14 15 $0,1,\ldots \mspace{11mu},{\frac{N_{1}O_{1}}{2} - 1}$ $0,1,\ldots \mspace{11mu},{\frac{N_{2}O_{2}}{2} - 1}$ W_(2x+3,2y,0) ⁽¹⁾ W_(2x+3,2y,1) ⁽¹⁾ W_(2x+3,2y,2) ⁽¹⁾ W_(2x+3,2y,3) ⁽¹⁾ ${{{where}\mspace{14mu} x} = i_{1,1}},{y = i_{1,2}},{W_{l,m,n}^{(1)} = {\frac{1}{\sqrt{P}}\begin{bmatrix} v_{l,m} \\ {\phi_{n}v_{l,m}} \end{bmatrix}}},{{{if}\mspace{14mu} N_{1}} \geq N_{2}}$ ${x = i_{1,2}},{y = i_{1,1}},{W_{l,m,n}^{(1)} = {\frac{1}{\sqrt{P}}\begin{bmatrix} v_{m,l} \\ {\phi_{n}v_{m,l}} \end{bmatrix}}},{{{if}\mspace{14mu} N_{1}} < N_{2}}$


9. The UE of claim 4, wherein a rank-2 codebook for a codebook configuration 3 is determined based on the dummy variables including the x and y according to a following codebook table: i₂ i_(1,1) i_(1,2) 0 1 2 3 $0,1,\ldots \mspace{11mu},{\frac{N_{1}O_{1}}{2} - 1}$ $0,1,\ldots \mspace{11mu},{\frac{N_{2}O_{2}}{2} - 1}$ W_(2x,2x,2y,2y,0) ⁽²⁾ W_(2x,2x,2y,2y,1) ⁽²⁾ W_(2x+1,2x+1,2y+1,2y+1,0) ⁽²⁾ W_(2x+1,2x+1,2y+1,2y+1,1) ⁽²⁾ i₂ i_(1,1) i_(1,2) 4 5 6 7 $0,1,\ldots \mspace{11mu},{\frac{N_{1}O_{1}}{2} - 1}$ $0,1,\ldots \mspace{11mu},{\frac{N_{2}O_{2}}{2} - 1}$ W_(2x+2,2x+2,2y,2y,0) ⁽²⁾ W_(2x+2,2x+2,2y,2y,1) ⁽²⁾ W_(2x+3,2x+3,2y+1,2y+1,0) ⁽²⁾ W_(2x+3,2x+3,2y+1,2y+1,1) ⁽²⁾ i₂ i_(1,1) i_(1,2) 8 9 10 11 $0,1,\ldots \mspace{11mu},{\frac{N_{1}O_{1}}{2} - 1}$ $0,1,\ldots \mspace{11mu},{\frac{N_{2}O_{2}}{2} - 1}$ W_(2x,2x+1,2y,2y+1,0) ⁽²⁾ W_(2x,2x+1,2y,2y+1,1) ⁽²⁾ W_(2x+1,2x+2,2y+1,2y,0) ⁽²⁾ W_(2x+1,2x+2,2y+1,2y,1) ⁽²⁾ i₂ i_(1,1) i_(1,2) 12 13 14 15 $0,1,\ldots \mspace{11mu},{\frac{N_{1}O_{1}}{2} - 1}$ $0,1,\ldots \mspace{11mu},{\frac{N_{2}O_{2}}{2} - 1}$ W_(2x,2x+3,2y,2y+1,0) ⁽²⁾ W_(2x,2x+3,2y,2y+1,1) ⁽²⁾ W_(2x+1,2x+3,2y+1,2y+1,0) ⁽²⁾ W_(2x+1,2x+3,2y+1,2y+1,1) ⁽²⁾ ${{{where}\mspace{14mu} x} = i_{1,1}},{y = i_{1,2}},{W_{l,l^{\prime},m,m^{\prime},n}^{(2)} = {\frac{1}{\sqrt{2P}}\begin{bmatrix} v_{l,m} & v_{l^{\prime},m^{\prime}} \\ {\phi_{n}v_{l,m}} & {{- \phi_{n}}v_{l^{\prime},m^{\prime}}} \end{bmatrix}}},{{{if}\mspace{14mu} N_{1}} \geq {N_{2}\mspace{14mu} {and}}}$ ${x = i_{1,2}},{y = i_{1,1}},{W_{l,l^{\prime},m,m^{\prime},n}^{(2)} = {\frac{1}{\sqrt{2P}}\begin{bmatrix} v_{m,l} & v_{m^{\prime},l^{\prime}} \\ {\phi_{n}v_{m,l}} & {{- \phi_{n}}v_{m^{\prime},l^{\prime}}} \end{bmatrix}}},{{{if}\mspace{14mu} N_{1}} < N_{2}}$

and the rank-2 codebook for a codebook configuration 4 is determined based on the dummy variables x and y according to a following codebook table: i₂ i_(1,1) i_(1,2) 0 1 2 3 $0,1,\ldots \mspace{11mu},{\frac{N_{1}O_{1}}{2} - 1}$ $0,1,\ldots \mspace{11mu},{\frac{N_{2}O_{2}}{2} - 1}$ W_(2x,2x,2y,2y,0) ⁽²⁾ W_(2x,2x,2y,2y,1) ⁽²⁾ W_(2x+1,2x+1,2y,2y,0) ⁽²⁾ W_(2x+1,2x+1,2y,2y,1) ⁽²⁾ i₂ i_(1,1) i_(1,2) 4 5 6 7 $0,1,\ldots \mspace{11mu},{\frac{N_{1}O_{1}}{2} - 1}$ $0,1,\ldots \mspace{11mu},{\frac{N_{2}O_{2}}{2} - 1}$ W_(2x+2,2x+2,2y,2y,0) ⁽²⁾ W_(2x+2,2x+2,2y,2y,1) ⁽²⁾ W_(2x+3,2x+3,2y,2y,0) ⁽²⁾ W_(2x+3,2x+3,2y,2y,1) ⁽²⁾ i₂ i_(1,1) i_(1,2) 8 9 10 11 $0,1,\ldots \mspace{11mu},{\frac{N_{1}O_{1}}{2} - 1}$ $0,1,\ldots \mspace{11mu},{\frac{N_{2}O_{2}}{2} - 1}$ W_(2x,2x+1,2y,2y,0) ⁽²⁾ W_(2x,2x+1,2y,2y,1) ⁽²⁾ W_(2x+1,2x+2,2y,2y,0) ⁽²⁾ W_(2x+1,2x+2,2y,2y,1) ⁽²⁾ i₂ i_(1,1) i_(1,2) 12 13 14 15 $0,1,\ldots \mspace{11mu},{\frac{N_{1}O_{1}}{2} - 1}$ $0,1,\ldots \mspace{11mu},{\frac{N_{2}O_{2}}{2} - 1}$ W_(2x,2x+3,2y,2y,0) ⁽²⁾ W_(2x,2x+3,2y,2y,1) ⁽²⁾ W_(2x+1,2x+3,2y,2y,0) ⁽²⁾ W_(2x+1,2x+3,2y,2y,1) ⁽²⁾ ${{{where}\mspace{14mu} x} = i_{1,1}},{y = i_{1,2}},{W_{l,l^{\prime},m,m^{\prime},n}^{(2)} = {\frac{1}{\sqrt{2P}}\begin{bmatrix} v_{l,m} & v_{l^{\prime},m^{\prime}} \\ {\phi_{n}v_{l,m}} & {{- \phi_{n}}v_{l^{\prime},m^{\prime}}} \end{bmatrix}}},{{{if}\mspace{14mu} N_{1}} \geq {N_{2}\mspace{14mu} {and}}}$ ${x = i_{1,2}},{y = i_{1,1}},{W_{l,l^{\prime},m,m^{\prime},n}^{(2)} = {\frac{1}{\sqrt{2P}}\begin{bmatrix} v_{m,l} & v_{m^{\prime},l^{\prime}} \\ {\phi_{n}v_{m,l}} & {{- \phi_{n}}v_{m^{\prime},l^{\prime}}} \end{bmatrix}}},{{{if}\mspace{14mu} N_{1}} < N_{2}}$


10. An eNodeB (eNB) in a wireless communication system, the eNB comprising: a transceiver configured to: transmit downlink signals, to a user equipment (UE), indicating precoder codebook parameters that include a first number of antenna ports (N₁) for a first dimension, a second number of antenna ports (N₂) for a second dimension, a first oversampling factor (O₁) for the first dimension, a second oversampling factor (O₂) for the second dimension, and a codebook configuration; and receive, from the UE, channel state information (CSI) including the first PMI pair (i_(1,1), i_(1,2)) and the second PMI (i₂); and at least one processor configured to swap precoder matrix indicator (PMI) expressions based on the N₁ and N₂, and the codebook configuration in order to reconstruct a PMI precoder using a single precoder codebook based on the received first PMI pair and second PMI.
 11. The eNB of claim 10, wherein the at least one processor is further configured to: identify a pair of parameters comprising (d₁, d₂) based on the N₁ and N₂; and parameterize a codebook table based on the identified pair of parameters (d₁, d₂), wherein the (d₁, d₂) are defined as at least one of: (d₁, d₂)=(1, 2) when the N₁ is greater or equal to the N₂; or (d₁, d₂)=(2, 1) when the N₁ is less than the N₂; and determine dummy variables including x and y based on a pair of parameters comprising the (d₁, d₂) in accordance with the N₁ and N₂, the dummy variables being determined as: x=i_(1,d1) and y=i_(1,d2).
 12. A method for operating user equipment (UE) in a wireless communication system, the method comprising: receiving, from an eNodeB (eNB), downlink signals indicating precoder codebook parameters that include a first number of antenna ports (N₁) for a first dimension, a second number of antenna ports (N₂) for a second dimension, a first oversampling factor (O₁) for the first dimension, a second oversampling factor (O₂) for the second dimension, and a codebook configuration; swapping precoder matrix indicator (PMI) expressions based on the N₁ and N₂, and the codebook configuration in order to derive a first PMI pair (i_(1,1), i_(1,2)), and a second PMI (i₂) using a single precoder codebook; and transmitting, to the eNB, channel state information (CSI) including the first PMI pair and the second PMI.
 13. The method of claim 12, further comprising: identifying a pair of parameters comprising (d₁, d₂) based on the N₁ and N₂; and parameterizing a codebook table based on the identified pair of parameters (d₁, d₂).
 14. The method of claim 12, wherein the (d₁, d₂) are defined as at least one of: (d₁, d₂)=(1, 2) when the N₁ is greater or equal to the N₂; or (d₁, d₂)=(2, 1) when the N₁ is less than the N₂.
 15. The method of claim 12, further comprising determining dummy variables including x and y based on a pair of parameters comprising (d₁, d₂) in accordance with the N₁ and N₂, the dummy variables being determined as: x=i_(1,d1) and y=i_(1,d2).
 16. The method of claim 12, wherein the swapped PMI expressions in a rank 1 codebook and a rank 2 codebook for a codebook configuration 3 and a codebook configuration 4 comprise an order of (m₁, m₂) based on the N₁ and N₂, and wherein m₁ is an index of a first discrete fourier transform (DFT) vector representing a beam for the first dimension, m₂ is an index of a second DFT vector representing a beam for the second dimension, and (m₁, m₂) is an index pair of a two-dimensional DFT vector (w_(m) ₁ _(,m) ₂ ) representing a beam, $w_{m_{1},m_{2}} = {\left\lbrack {u_{m_{2}}\mspace{14mu} ^{j\frac{2\pi \; m_{1}}{O_{1}N_{1}}}\mspace{14mu} u_{m_{2}}\mspace{14mu} \ldots \mspace{14mu} ^{j\frac{2\pi \; {m_{1}{({N_{1} - 1})}}}{O_{1}N_{1}}}\mspace{14mu} u_{m_{2}}} \right\rbrack^{T}\mspace{14mu} {where}}$ $u_{m_{2}} = {\left\lbrack {1\mspace{14mu} ^{j\frac{2\pi \; m_{2}}{O_{2}N_{2}}}\mspace{11mu} \ldots \mspace{14mu} ^{j\frac{2\pi \; {m_{2}{({N_{2} - 1})}}}{O_{2}N_{2}}}} \right\rbrack.}$
 17. The method of claim 16, wherein the order of (m₁, m₂) is defined as at least one of: (m₁, m₂) when the N₁ is greater than or equal to the N₂, or (m₂, m₁) when the N₁ is less than the N₂.
 18. The method of claim 17, wherein: when the N₁ is greater than or equal to the N₂, a rank 1 precoder based on the swapped PMI expressions is determined as: ${W_{m_{1},m_{2},n}^{(1)} = {\frac{1}{\sqrt{Q}}\begin{bmatrix} w_{m_{1},m_{2}} \\ {\phi_{n}w_{m_{1},m_{2}}} \end{bmatrix}}};$ and a rank 2 precoder based on the swapped PMI expressions is determined as: ${W_{m_{1},m_{2},m_{1}^{\prime},m_{2}^{\prime},n}^{(2)} = {\frac{1}{\sqrt{2Q}}\begin{bmatrix} w_{m_{1},m_{2}} & w_{m_{1}^{\prime},m_{2}^{\prime}} \\ {\phi_{n}w_{m_{1},m_{2}}} & {{- \phi_{n}}w_{m_{1}^{\prime},m_{2}^{\prime}}} \end{bmatrix}}};$ and when the N₁ is less than the N₂, the rank 1 precoder based on the swapped PMI expressions is determined as: ${W_{m_{1},m_{2},n}^{(1)} = {\frac{1}{\sqrt{Q}}\begin{bmatrix} w_{m_{2},m_{1}} \\ {\phi_{n}w_{m_{2},m_{1}}} \end{bmatrix}}};$ and a rank 2 precoder based on the swapped PMI expressions is determined as: ${W_{m_{1},m_{2},m_{1}^{\prime},m_{2}^{\prime},n}^{(2)} = {\frac{1}{\sqrt{2Q}}\begin{bmatrix} w_{m_{2},m_{1}} & w_{m_{2}^{\prime},m_{1}^{\prime}} \\ {\varphi_{n}w_{m_{2},m_{1}}} & {{- \varphi_{n}}w_{m_{2}^{\prime},m_{1}^{\prime}}} \end{bmatrix}}},$ where Q=2N₁N₂ and φ_(n)=e^(jπn/2).
 19. The method of claim 15, wherein a rank-1 codebook for a codebook configuration 3 is determined based on the dummy variables including the x and y according to a following codebook table: i₂ i_(1,1) i_(1,2) 0 1 2 3 $0,1,\ldots \mspace{11mu},{\frac{N_{1}O_{1}}{2} - 1}$ $0,1,\ldots \mspace{11mu},{\frac{N_{2}O_{2}}{2} - 1}$ W_(2x,2y,0) ⁽¹⁾ W_(2x,2y,1) ⁽¹⁾ W_(2x,2y,2) ⁽¹⁾ W_(2x,2y,3) ⁽¹⁾ i₂ i_(1,1) i_(1,2) 4 5 6 7 $0,1,\ldots \mspace{11mu},{\frac{N_{1}O_{1}}{2} - 1}$ $0,1,\ldots \mspace{11mu},{\frac{N_{2}O_{2}}{2} - 1}$ W_(2x+2,2y,0) ⁽¹⁾ W_(2x+2,2y,1) ⁽¹⁾ W_(2x+2,2y,2) ⁽¹⁾ W_(2x+2,2y,3) ⁽¹⁾ i₂ i_(1,1) i_(1,2) 8 9 10 11 $0,1,\ldots \mspace{11mu},{\frac{N_{1}O_{1}}{2} - 1}$ $0,1,\ldots \mspace{11mu},{\frac{N_{2}O_{2}}{2} - 1}$ W_(2x+1,2y+1,0) ⁽¹⁾ W_(2x+1,2y+1,1) ⁽¹⁾ W_(2x+1,2y+1,2) ⁽¹⁾ W_(2x+1,2y+1,3) ⁽¹⁾ i₂ i_(1,1) i_(1,2) 12 13 14 15 $0,1,\ldots \mspace{11mu},{\frac{N_{1}O_{1}}{2} - 1}$ $0,1,\ldots \mspace{11mu},{\frac{N_{2}O_{2}}{2} - 1}$ W_(2x+3,2y+1,0) ⁽¹⁾ W_(2x+3,2y+1,1) ⁽¹⁾ W_(2x+3,2y+1,2) ⁽¹⁾ W_(2x+3,2y+1,3) ⁽¹⁾ ${{{where}\mspace{14mu} x} = i_{1,1}},{y = i_{1,2}},{W_{l,m,n}^{(1)} = {\frac{1}{\sqrt{P}}\begin{bmatrix} v_{l,m} \\ {\phi_{n}v_{l,m}} \end{bmatrix}}},{{{if}\mspace{14mu} N_{1}} \geq N_{2}}$ ${x = i_{1,2}},{y = i_{1,1}},{W_{l,m,n}^{(1)} = {\frac{1}{\sqrt{P}}\begin{bmatrix} v_{m,l} \\ {\phi_{n}v_{m,l}} \end{bmatrix}}},{{{{if}\mspace{14mu} N_{1}} < N_{2}};}$

and the rank-1 codebook for a codebook configuration 4 is determined based on the dummy variables including the x and y according to a following codebook table: i₂ i_(1,1) i_(1,2) 0 1 2 3 $0,1,\ldots \mspace{11mu},{\frac{N_{1}O_{1}}{2} - 1}$ $0,1,\ldots \mspace{11mu},{\frac{N_{2}O_{2}}{2} - 1}$ W_(2x,2y,0) ⁽¹⁾ W_(2x,2y,1) ⁽¹⁾ W_(2x,2y,2) ⁽¹⁾ W_(2x,2y,3) ⁽¹⁾ i₂ i_(1,1) i_(1,2) 4 5 6 7 $0,1,\ldots \mspace{11mu},{\frac{N_{1}O_{1}}{2} - 1}$ $0,1,\ldots \mspace{11mu},{\frac{N_{2}O_{2}}{2} - 1}$ W_(2x+1,2y,0) ⁽¹⁾ W_(2x+1,2y,1) ⁽¹⁾ W_(2x+1,2y,2) ⁽¹⁾ W_(2x+1,2y,3) ⁽¹⁾ i₂ i_(1,1) i_(1,2) 8 9 10 11 $0,1,\ldots \mspace{11mu},{\frac{N_{1}O_{1}}{2} - 1}$ $0,1,\ldots \mspace{11mu},{\frac{N_{2}O_{2}}{2} - 1}$ W_(2x+2,2y,0) ⁽¹⁾ W_(2x+2,2y,1) ⁽¹⁾ W_(2x+2,2y,2) ⁽¹⁾ W_(2x+2,2y,3) ⁽¹⁾ i₂ i_(1,1) i_(1,2) 12 13 14 15 $0,1,\ldots \mspace{11mu},{\frac{N_{1}O_{1}}{2} - 1}$ $0,1,\ldots \mspace{11mu},{\frac{N_{2}O_{2}}{2} - 1}$ W_(2x+3,2y,0) ⁽¹⁾ W_(2x+3,2y,1) ⁽¹⁾ W_(2x+3,2y,2) ⁽¹⁾ W_(2x+3,2y,3) ⁽¹⁾ ${{{where}\mspace{14mu} x} = i_{1,1}},{y = i_{1,2}},{W_{l,m,n}^{(1)} = {\frac{1}{\sqrt{P}}\begin{bmatrix} v_{l,m} \\ {\phi_{n}v_{l,m}} \end{bmatrix}}},{{{if}\mspace{14mu} N_{1}} \geq N_{2}}$ ${x = i_{1,2}},{y = i_{1,1}},{W_{l,m,n}^{(1)} = {\frac{1}{\sqrt{P}}\begin{bmatrix} v_{m,l} \\ {\phi_{n}v_{m,l}} \end{bmatrix}}},{{{if}\mspace{14mu} N_{1}} < N_{2}}$


20. The method of claim 14, wherein a rank-2 codebook for a codebook configuration 3 is determined based on the dummy variables including the x and y according to a following codebook table: i₂ i_(1,1) i_(1,2) 0 1 2 3 $0,1,\ldots \mspace{11mu},{\frac{N_{1}O_{1}}{2} - 1}$ $0,1,\ldots \mspace{11mu},{\frac{N_{2}O_{2}}{2} - 1}$ W_(2x,2x,2y,2y,0) ⁽²⁾ W_(2x,2x,2y,2y,1) ⁽²⁾ W_(2x+1,2x+1,2y+1,2y+1,0) ⁽²⁾ W_(2x+1,2x+1,2y+1,2y+1,1) ⁽²⁾ i₂ i_(1,1) i_(1,2) 4 5 6 7 $0,1,\ldots \mspace{11mu},{\frac{N_{1}O_{1}}{2} - 1}$ $0,1,\ldots \mspace{11mu},{\frac{N_{2}O_{2}}{2} - 1}$ W_(2x+2,2x+2,2y,2y,0) ⁽²⁾ W_(2x+2,2x+2,2y,2y,1) ⁽²⁾ W_(2x+3,2x+3,2y+1,2y+1,0) ⁽²⁾ W_(2x+3,2x+3,2y+1,2y+1,1) ⁽²⁾ i₂ i_(1,1) i_(1,2) 8 9 10 11 $0,1,\ldots \mspace{11mu},{\frac{N_{1}O_{1}}{2} - 1}$ $0,1,\ldots \mspace{11mu},{\frac{N_{2}O_{2}}{2} - 1}$ W_(2x,2x+1,2y,2y+1,0) ⁽²⁾ W_(2x,2x+1,2y,2y+1,1) ⁽²⁾ W_(2x+1,2x+2,2y+1,2y,0) ⁽²⁾ W_(2x+1,2x+2,2y+1,2y,1) ⁽²⁾ i₂ i_(1,1) i_(1,2) 12 13 14 15 $0,1,\ldots \mspace{11mu},{\frac{N_{1}O_{1}}{2} - 1}$ $0,1,\ldots \mspace{11mu},{\frac{N_{2}O_{2}}{2} - 1}$ W_(2x,2x+3,2y,2y+1,0) ⁽²⁾ W_(2x,2x+3,2y,2y+1,1) ⁽²⁾ W_(2x+1,2x+3,2y+1,2y+1,0) ⁽²⁾ W_(2x+1,2x+3,2y+1,2y+1,1) ⁽²⁾ ${{{where}\mspace{14mu} x} = i_{1,1}},{y = i_{1,2}},{W_{l,l^{\prime},m,m^{\prime},n}^{(2)} = {\frac{1}{\sqrt{2P}}\begin{bmatrix} v_{l,m} & v_{l^{\prime},m^{\prime}} \\ {\phi_{n}v_{l,m}} & {{- \phi_{n}}v_{l^{\prime},m^{\prime}}} \end{bmatrix}}},{{{if}\mspace{14mu} N_{1}} \geq {N_{2}\mspace{14mu} {and}}}$ ${x = i_{1,2}},{y = i_{1,1}},{W_{l,l^{\prime},m,m^{\prime},n}^{(2)} = {\frac{1}{\sqrt{2P}}\begin{bmatrix} v_{m,l} & v_{m^{\prime},l^{\prime}} \\ {\phi_{n}v_{m,l}} & {{- \phi_{n}}v_{m^{\prime},l^{\prime}}} \end{bmatrix}}},{{{{if}\mspace{14mu} N_{1}} < N_{2}};}$

and the rank-2 codebook for a codebook configuration 4 is determined based on the dummy variables x and y according to a following codebook table: i₂ i_(1,1) i_(1,2) 0 1 2 3 $0,1,\ldots \mspace{11mu},{\frac{N_{1}O_{1}}{2} - 1}$ $0,1,\ldots \mspace{11mu},{\frac{N_{2}O_{2}}{2} - 1}$ W_(2x,2x,2y,2y,0) ⁽²⁾ W_(2x,2x,2y,2y,1) ⁽²⁾ W_(2x+1,2x+1,2y,2y,0) ⁽²⁾ W_(2x+1,2x+1,2y,2y,1) ⁽²⁾ i₂ i_(1,1) i_(1,2) 4 5 6 7 $0,1,\ldots \mspace{11mu},{\frac{N_{1}O_{1}}{2} - 1}$ $0,1,\ldots \mspace{11mu},{\frac{N_{2}O_{2}}{2} - 1}$ W_(2x+2,2x+2,2y,2y,0) ⁽²⁾ W_(2x+2,2x+2,2y,2y,1) ⁽²⁾ W_(2x+3,2x+3,2y,2y,0) ⁽²⁾ W_(2x+3,2x+3,2y,2y,1) ⁽²⁾ i₂ i_(1,1) i_(1,2) 8 9 10 11 $0,1,\ldots \mspace{11mu},{\frac{N_{1}O_{1}}{2} - 1}$ $0,1,\ldots \mspace{11mu},{\frac{N_{2}O_{2}}{2} - 1}$ W_(2x,2x+1,2y,2y,0) ⁽²⁾ W_(2x,2x+1,2y,2y,1) ⁽²⁾ W_(2x+1,2x+2,2y,2y,0) ⁽²⁾ W_(2x+1,2x+2,2y,2y,1) ⁽²⁾ i₂ i_(1,1) i_(1,2) 12 13 14 15 $0,1,\ldots \mspace{11mu},{\frac{N_{1}O_{1}}{2} - 1}$ $0,1,\ldots \mspace{11mu},{\frac{N_{2}O_{2}}{2} - 1}$ W_(2x,2x+3,2y,2y,0) ⁽²⁾ W_(2x,2x+3,2y,2y,1) ⁽²⁾ W_(2x+1,2x+3,2y,2y,0) ⁽²⁾ W_(2x+1,2x+3,2y,2y,1) ⁽²⁾ ${{{where}\mspace{14mu} x} = i_{1,1}},{y = i_{1,2}},{W_{l,l^{\prime},m,m^{\prime},n}^{(2)} = {\frac{1}{\sqrt{2P}}\begin{bmatrix} v_{l,m} & v_{l^{\prime},m^{\prime}} \\ {\phi_{n}v_{l,m}} & {{- \phi_{n}}v_{l^{\prime},m^{\prime}}} \end{bmatrix}}},{{{if}\mspace{14mu} N_{1}} \geq {N_{2}\mspace{14mu} {and}}}$ ${x = i_{1,2}},{y = i_{1,1}},{W_{l,l^{\prime},m,m^{\prime},n} = {\frac{1}{\sqrt{2P}}\begin{bmatrix} v_{m,l} & v_{m^{\prime},l^{\prime}} \\ {\phi_{n}v_{m,l}} & {{- \phi_{n}}v_{m^{\prime},l^{\prime}}} \end{bmatrix}}},{{{if}\mspace{14mu} N_{1}} < N_{2}}$ 